List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity.
Ilya DumerGrigory KabatianskyCédric TavernierPublished in: ISIT (2006)
Keyphrases
- linear complexity
- decoding algorithm
- error control
- parity check
- error correcting
- reed solomon
- low density parity check
- ldpc codes
- error correction
- decoding complexity
- joint source channel
- lower bound
- upper bound
- linear computational complexity
- error correcting codes
- reed solomon codes
- low complexity
- worst case
- rate allocation
- optimal solution
- turbo codes
- database
- decoding process
- hidden markov models
- error detection
- coding scheme
- video coding
- bit rate