On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs
Summary :
In this paper, we investigate Tanner's lower bound for the minimum distance of regular LDPC codes based on combinatorial designs. We first determine Tanner's lower bound for LDPC codes which are defined by modifying bipartite graphs obtained from combinatorial designs known as Steiner systems. Then we show that Tanner's lower bound agrees with or exceeds conventional lower bounds including the BCH bound, and gives the true minimum distance for some EG-LDPC codes.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2428-2434
- 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
Tomoharu SHIBUYA, Masatoshi ONIKUBO, Kohichi SAKANIWA, "On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 10, pp. 2428-2434, October 2003, doi: .
Abstract: In this paper, we investigate Tanner's lower bound for the minimum distance of regular LDPC codes based on combinatorial designs. We first determine Tanner's lower bound for LDPC codes which are defined by modifying bipartite graphs obtained from combinatorial designs known as Steiner systems. Then we show that Tanner's lower bound agrees with or exceeds conventional lower bounds including the BCH bound, and gives the true minimum distance for some EG-LDPC codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2428/_p
Copy
@ARTICLE{e86-a_10_2428,
author={Tomoharu SHIBUYA, Masatoshi ONIKUBO, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs},
year={2003},
volume={E86-A},
number={10},
pages={2428-2434},
abstract={In this paper, we investigate Tanner's lower bound for the minimum distance of regular LDPC codes based on combinatorial designs. We first determine Tanner's lower bound for LDPC codes which are defined by modifying bipartite graphs obtained from combinatorial designs known as Steiner systems. Then we show that Tanner's lower bound agrees with or exceeds conventional lower bounds including the BCH bound, and gives the true minimum distance for some EG-LDPC codes.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2428
EP - 2434
AU - Tomoharu SHIBUYA
AU - Masatoshi ONIKUBO
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 - In this paper, we investigate Tanner's lower bound for the minimum distance of regular LDPC codes based on combinatorial designs. We first determine Tanner's lower bound for LDPC codes which are defined by modifying bipartite graphs obtained from combinatorial designs known as Steiner systems. Then we show that Tanner's lower bound agrees with or exceeds conventional lower bounds including the BCH bound, and gives the true minimum distance for some EG-LDPC codes.
ER -
English
