On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
| dc.creator | Sason, Igal | |
| dc.creator | Wiechman, Gil | |
| dc.date | 2005-12-18 | |
| dc.date.accessioned | 2026-07-07T08:15:49Z | |
| dc.date.available | 2026-07-07T08:15:49Z | |
| dc.description | 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. | |
| dc.description | 5 pages. The paper is submitted to the 2006 IEEE International Symposium on Information Theory (ISIT 2006), Seatle, Washington, USA, 9--14 July, 2006. The full paper version was submitted to the IEEE Trans. on Information Theory, August 2005 and is online available at http://arxiv.org/abs/cs.IT/0508072 | |
| dc.identifier | https://arxiv.org/abs/cs/0512076 | |
| dc.identifier | http://arxiv.org/abs/cs/0512076 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133574 | |
| dc.subject | Information Theory | |
| dc.title | On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications | |
| dc.type | text |