Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]

DOI10.1109/TIT.2008.924654MaRDI QIDQ3604679zbMATH OpenOpenAlexFDO

Authors Gil Wiechman, Igal Sason

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0512076

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Abstract: 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.

Cited in

(2)

• Correction to "The Weight Spectra of Some Short Low Rate Convolutional Codes"
• A modification of the artificial compressibility algorithm with improved convergence characteristics

This page was built for publication: Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604679)