New Classes of Permutation Binomials and Permutation Trinomials over Finite Fields

August 30, 2015 Β· Declared Dead Β· πŸ› Finite Fields Their Appl.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kangquan Li, Longjiang Qu, Xi Chen arXiv ID 1508.07590 Category cs.IT: Information Theory Cross-listed math.NT Citations 118 Venue Finite Fields Their Appl. Last Checked 4 months ago
Abstract
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication theory and so on. Permutation binomials and trinomials attract people's interest due to their simple algebraic form and additional extraordinary properties. In this paper, several new classes of permutation binomials and permutation trinomials are constructed. Some of these permutation polynomials are generalizations of known ones.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted