On maximum contention-free interleavers and permutation polynomials over integer rings

DOI10.1109/TIT.2005.864450zbMath1283.94133arXivcs/0506093MaRDI QIDQ3547689

Oscar Yassuo Takeshita

Publication date: 21 December 2008

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

Full work available at URL: https://arxiv.org/abs/cs/0506093

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (6)

Explicit formulas for monomial involutions over finite fields ⋮ Permutation polynomials over finite rings ⋮ A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings ⋮ 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 ⋮ Unnamed Item

This page was built for publication: On maximum contention-free interleavers and permutation polynomials over integer rings