Return
A simple coefficient test for cubic permutation polynomials over integer rings
DOI:10.1109/LCOM.2006.224416.png)
Abstract
En 中文
Permutation polynomials have been extensively studied but simple coefficient tests for permutation polynomials over integer rings are only known for limited cases. In this letter, a simple necessary and sufficient coefficient test is proven for cubic permutation polynomials over integer rings. A possible application is in the design of interleavers for turbo codes.
Keywords:
algebraic
cubic polynomial
interleaver
permutation polynomial
turbo code
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available

