DocumentCode :
1265970
Title :
On ensembles of low-density parity-check codes: asymptotic distance distributions
Author :
Litsyn, Simon ; Shevelev, Vladimir
Author_Institution :
Dept. of Electr. Engineering-Systems, Tel Aviv Univ., Israel
Volume :
48
Issue :
4
fYear :
2002
fDate :
4/1/2002 12:00:00 AM
Firstpage :
887
Lastpage :
908
Abstract :
We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matrices having given column and row sums, ensembles defined by matrices with given column sums or given row sums, and an ensemble defined by bipartite graphs
Keywords :
error detection codes; graph theory; matrix algebra; LDPC; asymptotic distance distributions; average distance distributions; binary parity-check matrices; bipartite graphs; column sums; low-density parity-check codes; row sums; Absorption; Bipartite graph; Code standards; Iterative algorithms; Iterative decoding; Mathematics; Maximum likelihood estimation; Parity check codes; Performance analysis; Strips;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.992777
Filename :
992777
Link To Document :
بازگشت