Chained Gallager codes
(2009) International Symposium on Problems of Redundancy in Information and Control Systems- Abstract
- The ensemble of regular Low-Density Parity-Check (LDPC) codes introduced by Gallager is considered. Using probabilistic arguments a lower bound on the normalized minimum distance is derived. A new code construction, called Chained Gallager codes, is introduced as the combination of two Gallager codes and its error correcting capabilities are studied.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1369522
- author
- Zyablov, Victor ; Hug, Florian LU and Johannesson, Rolf LU
- organization
- publishing date
- 2009
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- International Symposium on Problems of Redundancy in Information and Control Systems
- conference dates
- 2009-05-26 - 2009-05-30
- language
- English
- LU publication?
- yes
- id
- 733ec05b-9c42-4352-b11a-0960ea3a6e20 (old id 1369522)
- date added to LUP
- 2016-04-04 14:22:58
- date last changed
- 2018-11-21 21:20:00
@misc{733ec05b-9c42-4352-b11a-0960ea3a6e20, abstract = {{The ensemble of regular Low-Density Parity-Check (LDPC) codes introduced by Gallager is considered. Using probabilistic arguments a lower bound on the normalized minimum distance is derived. A new code construction, called Chained Gallager codes, is introduced as the combination of two Gallager codes and its error correcting capabilities are studied.}}, author = {{Zyablov, Victor and Hug, Florian and Johannesson, Rolf}}, language = {{eng}}, title = {{Chained Gallager codes}}, url = {{https://lup.lub.lu.se/search/files/6347698/1593308.pdf}}, year = {{2009}}, }