On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
Igal SasonGil WiechmanPublished in: CoRR (2005)
Keyphrases
- information theoretic
- source coding
- ldpc codes
- channel conditions
- mutual information
- information theory
- worst case
- information theoretic measures
- low density parity check
- image transmission
- computational complexity
- computer vision
- decoding algorithm
- kullback leibler divergence
- space complexity
- message passing
- machine learning
- error correction
- image registration
- lower bound