Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance.
Alexander ZehSan LingPublished in: CoRR (2014)
Keyphrases
- lower bound
- decoding algorithm
- upper bound
- parity check
- error control
- ldpc codes
- joint source channel
- low density parity check
- reed solomon
- error correcting
- decoding complexity
- error correction
- branch and bound algorithm
- variable length
- convolutional codes
- np hard
- branch and bound
- objective function
- error correcting codes
- optimal solution
- image transmission
- coding scheme
- lower and upper bounds
- turbo codes
- non binary
- sufficiently accurate
- worst case
- special case
- reed solomon codes
- lower bounding
- linear programming relaxation
- rate allocation
- bit errors
- decoding process
- low complexity
- data structure