Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes

Authors:
Dmitri Truhachev;Kamil Sh. Zigangirov;Daniel J. Costello
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Institute for Problems of Information Transmission, Moscow, Russia and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN and Department of Electrical and Information T ...;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
Information Theory and Reliable Communication

Information Theory and Reliable Communication
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Problems of Information Transmission
Time-varying periodic convolutional codes with low-density parity-check matrix

IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices

IEEE Transactions on Information Theory
Distance Bounds for an Ensemble of LDPC Convolutional Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

Existence type lower bounds on the free distance of periodically time-varying LDPC convolutional codes and on the minimum distance of tail-biting LDPC convolutional codes are derived. It is demonstrated that the bound on free distance of periodically time-varying LDPC convolutional codes approaches the bound on free distance of general (nonperiodic) time-varying LDPC convolutional codes as the period increases. The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting LDPC convolutional codes, which is of interest in its own right.