DocumentCode
2946097
Title
On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation
Author
Tillich, Jean-Pierre ; Zémor, Gilles
Author_Institution
INRIA
fYear
2006
fDate
9-14 July 2006
Firstpage
1549
Lastpage
1553
Abstract
We investigate the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation and show that their minimum distance is a sub-linear power function of the code length
Keywords
matrix algebra; parity check codes; parity-check equation; structured LDPC codes; sub-linear power function; Bit error rate; Channel capacity; Encoding; Equations; Error correction codes; H infinity control; Iterative decoding; Parity check codes; Turbo codes; Turning;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.262128
Filename
4036227
Link To Document