A proof of maximum contention-free property of interleavers for turbo codes using permutation polynomials over integer rings
From MaRDI portal
(Redirected from Publication:886384)
Recommendations
- On maximum contention-free interleavers and permutation polynomials over integer rings
- Interleavers for turbo codes using permutation polynomials over integer rings
- Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
- Permutation polynomial interleavers for turbo codes
- On quadratic inverses for quadratic permutation polynomials over integer rings
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- Interleavers for turbo codes using permutation polynomials over integer rings
- On maximum contention-free interleavers and permutation polynomials over integer rings
- On quadratic inverses for quadratic permutation polynomials over integer rings
Cited in
(6)- Permutation polynomial interleavers for turbo codes
- Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers
- 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
- Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective
This page was built for publication: A proof of maximum contention-free property of 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 Q886384)