Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers

DOI10.1016/J.JFRANKLIN.2020.02.031zbMath1468.94488OpenAlexW3007495945MaRDI QIDQ1989318

Lucian Trifina, Ana-Mirela Rotopanescu, Daniela Tarniceriu, Jonghoon Ryu

Publication date: 21 April 2020

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2020.02.031

Mathematics Subject Classification ID

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

Uses Software

• LDPC

Cites Work

• Interleavers for turbo codes using permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings
• Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
• Performance Analysis of 3-D Turbo Codes

This page was built for publication: Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers