Construction of Universal Codes Using LDPC Matrices and Their Error Exponents
Summary :
A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.9 pp.1830-1839
- Publication Date
- 2007/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.9.1830
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
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
Shigeki MIYAKE, Mitsuru MARUYAMA, "Construction of Universal Codes Using LDPC Matrices and Their Error Exponents" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 9, pp. 1830-1839, September 2007, doi: 10.1093/ietfec/e90-a.9.1830.
Abstract: A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.9.1830/_p
Copy
@ARTICLE{e90-a_9_1830,
author={Shigeki MIYAKE, Mitsuru MARUYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Construction of Universal Codes Using LDPC Matrices and Their Error Exponents},
year={2007},
volume={E90-A},
number={9},
pages={1830-1839},
abstract={A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.},
keywords={},
doi={10.1093/ietfec/e90-a.9.1830},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Construction of Universal Codes Using LDPC Matrices and Their Error Exponents
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1830
EP - 1839
AU - Shigeki MIYAKE
AU - Mitsuru MARUYAMA
PY - 2007
DO - 10.1093/ietfec/e90-a.9.1830
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2007
AB - A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.
ER -
English
