Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
Roxana SmarandachePascal O. VontobelPublished in: CoRR (2009)
Keyphrases
- graph structure
- hamming distance
- upper bound
- ldpc codes
- lower bound
- graphical models
- decoding algorithm
- message passing
- error correction
- pattern matching
- belief propagation
- distance measure
- directed graph
- edit distance
- hash functions
- low density parity check
- image transmission
- tree structure
- probabilistic model
- data mining
- end to end
- random walk
- channel coding
- distributed systems