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