Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes

DOI10.1109/TIT.2010.2053873MaRDI QIDQ5281291zbMATH OpenOpenAlexFDO

Authors Dmitri V. Truhachev, Kamil S. Zigangirov, Daniel J. jun. Costello

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Bounds on codes (94B65) Convolutional codes (94B10)

Cited in

(5)

• New asymptotic lower bounds on the free distance for time-constant convolutional codes
• State-space realizations of periodic convolutional codes
• Rate amplification and query-efficient distance amplification for linear LCC and LDC
• Improved error exponent for time-invariant and periodically time-variant convolutional codes
• Periodic state-space representations of periodic convolutional codes

This page was built for publication: Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281291)