Distance Bounds for an Ensemble of LDPC Convolutional Codes

DOI10.1109/TIT.2007.909113zbMath1320.94096OpenAlexW1984762281MaRDI QIDQ3549108

K. Sh. Zigangirov, Dmitri Truhachev, M. Lentmaier, A. Sridharan, Daniel J. jun. Costello

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.909113

Mathematics Subject Classification ID

Convolutional codes (94B10)

Related Items (3)

Asymptotically good convolutional codes ⋮ On the error-correcting capability of LDPC codes ⋮ On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

This page was built for publication: Distance Bounds for an Ensemble of LDPC Convolutional Codes