Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
Information Theory
2008-04-29 v1 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.0804.4466,
title = {Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes},
author = {David G. M. Mitchell and Ali E. Pusane and Norbert Goertz and Daniel J. Costello},
journal= {arXiv preprint arXiv:0804.4466},
year = {2008}
}
Comments
6 pages, 4 figures, 1 table