Interleavers for turbo codes using permutation polynomials over integer rings
From MaRDI portal
Publication:3547673
DOI10.1109/TIT.2004.839478zbMATH Open1280.94121OpenAlexW2131769628MaRDI QIDQ3547673FDOQ3547673
Authors: 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
Recommendations
- Permutation polynomial interleavers for turbo codes
- A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings
- On maximum contention-free interleavers and permutation polynomials over integer rings
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
- On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
- Interleaver properties and their applications to the trellis complexity analysis of turbo codes
- New deterministic interleaver designs for turbo codes
- On quasi-cyclic interleavers for parallel turbo codes
- A Note on Interleaved Reed–Solomon Codes Over Galois Rings
- scientific article; zbMATH DE number 2059737
Cited In (36)
- On quadratic inverses for quadratic permutation polynomials over integer rings
- On maximum contention-free interleavers and permutation polynomials over integer rings
- Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers
- A note on permutation polynomials over finite fields
- New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers
- Some new results on permutation polynomials over finite fields
- Title not available (Why is that?)
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some results concerning the design and decoding of turbo-codes
- Blind detection of interleaver parameters
- Permutation polynomials and their differential properties over residue class rings
- A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings
- Bolt interleavers for turbo codes
- Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
- Two new classes of (almost) perfect \(c\)-nonlinear permutations
- Polynomial functions over dual numbers of several variables
- More classes of permutation trinomials with Niho exponents
- Permutation polynomials over finite rings
- Stream-oriented turbo codes
- Joint Permutor Analysis and Design for Multiple Turbo Codes
- On permutation polynomials of prescribed shape
- Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
- Interleaver properties and their applications to the trellis complexity analysis of turbo codes
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
- New deterministic interleaver designs for turbo codes
- Permutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristic
- Design of two step deterministic interleaver for turbo codes
- More explicit classes of permutation polynomials of \(\mathbb F_{3^{3m}}\)
- The Carlitz rank of permutations of finite fields: a survey
- New permutation trinomials constructed from fractional polynomials
- Title not available (Why is that?)
- Permutation fixed points with application to estimation of minimum distance of turbo codes
This page was built for publication: Interleavers for turbo codes using permutation polynomials over integer rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547673)
