Detailedly Represented Irregular Low-Density Parity-Check Codes
Summary :
Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2435-2444
- Publication Date
- 2003/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kenta KASAI, Tomoharu SHIBUYA, Kohichi SAKANIWA, "Detailedly Represented Irregular Low-Density Parity-Check Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 10, pp. 2435-2444, October 2003, doi: .
Abstract: Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2435/_p
Copy
@ARTICLE{e86-a_10_2435,
author={Kenta KASAI, Tomoharu SHIBUYA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Detailedly Represented Irregular Low-Density Parity-Check Codes},
year={2003},
volume={E86-A},
number={10},
pages={2435-2444},
abstract={Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Detailedly Represented Irregular Low-Density Parity-Check Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2435
EP - 2444
AU - Kenta KASAI
AU - Tomoharu SHIBUYA
AU - Kohichi SAKANIWA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - Richardson and Urbanke developed a powerful method density evolution which determines, for various channels, the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.
ER -
English
