2008/04/28 by David G. M. Mitchell, Ali E. Pusane, Mitchell, David G. M. +5
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0804.4466
6 pages, 4 figures, 1 table
arxiv created 2008/04/28 · arxiv updated 2009/12/01
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.