On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers

DOI10.1109/TIT.2012.2192095zbMath1365.94544OpenAlexW2101831489MaRDI QIDQ5271840

Eirik Rosnes

Publication date: 12 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.2012.2192095

Mathematics Subject Classification ID

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

Related Items (2)

Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers ⋮ Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers

This page was built for publication: On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers