On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
<|reference_start|>On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications: The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where these channels are memoryless, binary-input and output-symmetric (MBIOS). The bounds are applied to punctured LDPC codes. A diagram concludes our discussion by showing interconnections between the theorems in this paper and some previously reported results.<|reference_end|>
@article{sason2005on,
    title={On Achievable Rates and Complexity of LDPC Codes for Parallel Channels:
  Information-Theoretic Bounds and Applications},
    author={Igal Sason and Gil Wiechman},
    journal={arXiv preprint arXiv:cs/0512076},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512076},
    primaryClass={cs.IT math.IT}
}