Interleavers for turbo codes using permutation polynomials over integer rings

From MaRDI portal
Publication:3547673

DOI10.1109/TIT.2004.839478zbMath1280.94121OpenAlexW2131769628MaRDI QIDQ3547673

Jing Sun, 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://doi.org/10.1109/tit.2004.839478




Related Items (20)

New permutation trinomials constructed from fractional polynomialsNew constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)A note on permutation polynomials over finite fieldsPermutation polynomials over finite ringsFull classification of permutation rational functions and complete rational functions of degree three over finite fieldsA proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer ringsPolynomial functions over dual numbers of several variablesPermutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristicThe Carlitz rank of permutations of finite fields: a surveyPermutation polynomials and their differential properties over residue class ringsMore classes of permutation trinomials with Niho exponentsParallel access by butterfly networks for any degree permutation polynomial and ARP interleaversFour classes of permutation polynomials of \(\mathbb F_{2^m}\)Some lengths for which CPP interleavers have weaker minimum distances than QPP interleaversSome new results on permutation polynomials over finite fieldsMore explicit classes of permutation polynomials of \(\mathbb F_{3^{3m}}\)Cyclotomic Mapping Permutation Polynomials over Finite FieldsOn permutation polynomials of prescribed shapeUnnamed ItemUnnamed Item






This page was built for publication: Interleavers for turbo codes using permutation polynomials over integer rings