Distance Bounds for an Ensemble of LDPC Convolutional Codes

Authors:
A. Sridharan;D. Truhachev;M. Lentmaier;D. J. Costello;K. Sh. Zigangirov
Affiliations:
Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 4

On the error-correcting capability of LDPC codes

Problems of Information Transmission
Jointly designed architecture-aware LDPC convolutional codes and high-throughput parallel encoders/decoders

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes

IEEE Transactions on Information Theory
Iterative decoding threshold analysis for LDPC convolutional codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.96

Visualization

Abstract

An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance dL, of code segments of finite length L and on the free distance dfree are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio dL/v approaches the ratio dfee/v for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.