Presentation 2002/7/9
On lower bounds for the minimum distance of LDPC codes constructed by combinatorial design
Masatoshi ONIKUBO, Tomoharu SHIBUYA, Kohichi SAKANIWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we investigate the tightness of Tanner's lower bound for the minimum distance of regular low-density parity-check (LDPC) codes. More precisely, we introduce two classes of regular LDPC codes based on a combinatorial design known as Steiner system and we formulate Tanner's lower bound for these codes. Moreover, we point out that one of these two classes of codes contains EG-LDPC codes and show that Tanner's lower bound agrees with BCH bound for EG-LDPC codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) regular LDPC codes / minimum distance / combinatorial design / Steiner system / graph theory
Paper # IT2002-22
Date of Issue

Conference Information
Committee IT
Conference Date 2002/7/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On lower bounds for the minimum distance of LDPC codes constructed by combinatorial design
Sub Title (in English)
Keyword(1) regular LDPC codes
Keyword(2) minimum distance
Keyword(3) combinatorial design
Keyword(4) Steiner system
Keyword(5) graph theory
1st Author's Name Masatoshi ONIKUBO
1st Author's Affiliation Dept. of Computer Science, Tokyo Institute of Technology()
2nd Author's Name Tomoharu SHIBUYA
2nd Author's Affiliation Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
3rd Author's Name Kohichi SAKANIWA
3rd Author's Affiliation Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
Date 2002/7/9
Paper # IT2002-22
Volume (vol) vol.102
Number (no) 198
Page pp.pp.-
#Pages 6
Date of Issue