Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance.
Alexander ZehSan LingPublished in: ISIT (2014)
Keyphrases
- lower bound
- decoding algorithm
- error control
- upper bound
- parity check
- reed solomon
- ldpc codes
- error correcting
- low density parity check
- joint source channel
- error correction
- decoding complexity
- branch and bound algorithm
- branch and bound
- error correcting codes
- objective function
- np hard
- lower and upper bounds
- lower bounding
- turbo codes
- noise model
- decoding process
- reed solomon codes
- optimal solution
- low complexity
- worst case
- convolutional codes
- competitive ratio
- linear programming relaxation
- error detection
- sample complexity
- image quality
- soft decision
- sufficiently accurate
- polynomial approximation
- dynamic programming
- coding scheme
- learning theory
- viterbi algorithm
- variable length
- distributed video coding
- image transmission