DocumentCode
749240
Title
Generalization of Tanner´s minimum distance bounds for LDPC codes
Author
Shin, Min-Ho ; Kim, Joon-Sung ; Song, Hong-Yeop
Author_Institution
Dept. of Electr. & Electron. Eng., Yonsei Univ., Seoul, South Korea
Volume
9
Issue
3
fYear
2005
fDate
3/1/2005 12:00:00 AM
Firstpage
240
Lastpage
242
Abstract
Tanner derived minimum distance bounds of regular codes in terms of the eigenvalues of the adjacency matrix by using some graphical analysis on the associated graph of the code. In this letter, we generalize Tanner´s results by deriving a bit-oriented bound and a parity-oriented bound on the minimum distances of both regular and block-wise irregular LDPC codes.
Keywords
block codes; eigenvalues and eigenfunctions; error correction codes; graph theory; matrix algebra; parity check codes; LDPC codes; Tanner derived minimum distance bounds; adjacency matrix; bit-oriented bound; block-wise irregular LDPC codes; code graph; eigenvalues; graphical analysis; low-density parity check codes; minimum distances; parity-oriented bound; regular LDPC codes; regular codes; Bipartite graph; Eigenvalues and eigenfunctions; Error correction codes; Iterative decoding; Parity check codes; Performance analysis; Sparse matrices; Virtual colonoscopy; Wireless communication;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2005.03002
Filename
1411019
Link To Document