Questions tagged [error-correcting-codes]

Error correcting codes are used to transmit information through a noisy channel. They also have applications in theoretical computer science and combinatorics. Some well known error correcting codes are Hamming codes, Reed–Solomon codes, and Reed–Muller codes.

Filter by
Sorted by
Tagged with
4
votes
1answer
36k views

Hamming distance required for error detection and correction

I have already asked a pair of questions on the hamming distance, hamming code, valid and invalid codewords on this website, because I cannot understand those concepts fully, and in a few weeks or ...
2
votes
2answers
17k views

Hamming distance necessary for detecting d-bit error and for correcting a d-bit error [duplicate]

I am trying to understand what hamming distance of a code is needed to detect a d-bit error, or to correct a d-bit error. This is what I have found around the web: If two codewords are Hamming ...
1
vote
1answer
348 views

Convolutional and Linear block codes

Both convolution and linear block codes can be used for error correction. The main benefits I gathered from using convolutional codes is that, it's easy to implement and does better (than linear codes)...
2
votes
1answer
103 views

Hamming error correction with non-uniform error correction capability

If I understood correctly, Hamming codes assume the uniform correction among all the bits. This means all the bits have the same weight in terms of correction. Are there any error correcting codes ...