Masatoshi ONIKUBO

On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs
Tomoharu SHIBUYA Masatoshi ONIKUBO Kohichi SAKANIWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/10/01
Vol. E86-A  No. 10  pp. 2428-2434
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
LDPC codesthe minimum distance Tanner grapht-designSteiner system
 Summary | Full Text:PDF(275.6KB)