Combinatorial analysis of the minimum distance of turbo codes

DOI10.1109/18.959256zbMATH Open1015.94019OpenAlexW2101554026MaRDI QIDQ4544718FDOQ4544718

Authors: Marco Breiling, Johannes Huber 

Publication date: 4 August 2002

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

Full work available at URL: https://semanticscholar.org/paper/03079741b45d50c7bb7fc3246dba1530fb0ee961

Recommendations

• A New Upper Bound on the Minimum Distance of Turbo Codes
• Upper bound on the minimum distance of turbo codes
• New performance bounds for turbo codes
• Permutation fixed points with application to estimation of minimum distance of turbo codes
• Some results concerning the design and decoding of turbo-codes

zbMATH Keywords

turbo codesminimum Hamming distanceinterleaver design

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Cited In (7)

• Some results concerning the design and decoding of turbo-codes
• New performance bounds for turbo codes
• Bolt interleavers for turbo codes
• A New Upper Bound on the Minimum Distance of Turbo Codes
• Joint Permutor Analysis and Design for Multiple Turbo Codes
• Upper bound on the minimum distance of turbo codes
• Permutation fixed points with application to estimation of minimum distance of turbo codes

This page was built for publication: Combinatorial analysis of the minimum distance of turbo codes

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