Title :
On the free distance of LDPC convolutional codes
Author :
Sridharan, Arun ; Truhachev, Dmitry ; Lentmaier, Michael ; Costello, Daniel J. ; Zigangirov, K.S.
Author_Institution :
Notre Dame Univ., IN
fDate :
June 27 2004-July 2 2004
Abstract :
A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices comprised of MtimesM permutation matrices is derived. We show that asymptotically, i.e., as Mrarrinfin, for almost all codes in the ensemble the free distance grows linearly with constraint length
Keywords :
convolutional codes; matrix algebra; parity check codes; LDPC convolutional code; permutation matrices; Block codes; Convolutional codes; Mathematics; Parity check codes; Probability distribution;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365349
