Circular Tuscan-k arrays from permutation binomials
From MaRDI portal
A new construction for Tuscan-\(k\) arrays is presented based on the construction of a series of set complete mappings. The construction is found from the study of permutation polynomials over finite fields.
Recommendations
Cites work
- Algebraic constructions for Costas arrays
- Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
- scientific article; zbMATH DE number 426120 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4023299 (Why is no real title available?)
- scientific article; zbMATH DE number 11982 (Why is no real title available?)
- scientific article; zbMATH DE number 691488 (Why is no real title available?)
- scientific article; zbMATH DE number 874549 (Why is no real title available?)
- On \((n,k)\)-sequences
- On periodicity properties of Costas arrays and a conjecture on permutation polynomials
- On permutation polynomials over finite fields
- Permutation binomials
- Tuscan-K squares
Cited in
(10)- On permutation polynomials of prescribed shape
- The existence of circular Florentine arrays
- Permutation binomials over finite fields
- Permutation polynomials with Carlitz rank 2
- Quasi-permutation polynomials.
- A new construction of two-dimensional arrays with the window property
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
- scientific article; zbMATH DE number 1943092 (Why is no real title available?)
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- On S-complete mappings for large S
This page was built for publication: Circular Tuscan-\(k\) arrays from permutation binomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604580)
