Permutation fixed points with application to estimation of minimum distance of turbo codes

DOI10.1109/18.887848MaRDI QIDQ2705967zbMATH OpenOpenAlexFDO

Authors Fred Daneshgaran, Marina Mondin

Publication date 19 March 2001

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

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

zbMATH Keywords

interleaversparallel concatenated codespermutation fixed pointsturbo codes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Source coding (94A29) Convolutional codes (94B10) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Interleavers for turbo codes using permutation polynomials over integer rings
• Combinatorial analysis of the minimum distance of turbo codes
• Joint Permutor Analysis and Design for Multiple Turbo Codes
• Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
• Some results concerning the design and decoding of turbo-codes

Cited in

(3)

• On higher order permutors for serially concatenated convolutional codes
• Joint Permutor Analysis and Design for Multiple Turbo Codes
• Combinatorial analysis of the minimum distance of turbo codes

This page was built for publication: Permutation fixed points with application to estimation of minimum distance of turbo codes

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