arXiv (All)
open access
Cycle structures and parities of linearized permutation polynomials
Linearized permutation polynomials over finite fields have important applications in coding theory, cryptography, and combinatorics. In this paper, we give an explicit description of the cycle structure of a general linearized permutation polynomial in terms of the Jordan blocks of its Dickson matri
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The differential properties of certain permutation polynomials over finite fields#684157
- The differential properties of certain permutation polynomials over finite fields#682382
- Constructions of complete permutations over $\mathbb{F}_q^n$#972621
- De Bruijn Polyominoes#793385
- De Bruijn Polyominoes#789381
Record · ID 1248854
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive