A simple coefficient test for cubic permutation polynomials over integer rings

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.