The Minimum Distance of Turbo-Like Codes

DOI10.1109/TIT.2008.2008114MaRDI QIDQ4975666zbMATH OpenOpenAlexFDO

Authors Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman

Publication date 8 August 2017

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

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

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cited in

(5)

• A New Upper Bound on the Minimum Distance of Turbo Codes
• Decoding turbo-like codes via linear programming
• Expand-convolute codes for pseudorandom correlation generators from LPN
• Blaze: fast SNARKs from interleaved RAA codes
• Upper bounds on the minimum distance of LDPC codes with double diagonal parity checks

This page was built for publication: The Minimum Distance of Turbo-Like Codes

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