A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings

DOI10.1631/JZUS.2007.A0024zbMath1221.94097MaRDI QIDQ886384

Xinrui Ma, Le Zhang, You-yun Xu

Publication date: 27 June 2007

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

permutation polynomialturbo codescontention-free interleaver designinterleaversturbo decoding

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35) Error probability in coding theory (94B70)

Cites Work

• Unnamed Item
• On quadratic inverses for quadratic permutation polynomials over integer rings
• Interleavers for turbo codes using permutation polynomials over integer rings
• On maximum contention-free interleavers and permutation polynomials over integer rings

This page was built for publication: A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings