Authors
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.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2006) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: