Fast decoding of regular LDPC codes using greedy approximation algorithms.
Nicholas KalouptsidisNicholas KolokotronisPublished in: ISIT (2011)
Keyphrases
- approximation algorithms
- ldpc codes
- decoding algorithm
- low density parity check
- error correction
- message passing
- np hard
- greedy algorithm
- worst case
- special case
- image transmission
- greedy heuristic
- rate allocation
- search algorithm
- noise model
- constant factor
- constant factor approximation
- channel coding
- search space
- greedy algorithms
- coding scheme
- source coding
- non binary
- bitstream
- dynamic programming
- pairwise