Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
classification
💻 cs.IT
math.IT
keywords
codesdistanceldpcconvolutionalfreelengthratioregular
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.