Finite field constructions of combinatorial arrays
From MaRDI portal
Recommendations
- On constructing permutations of finite fields
- scientific article; zbMATH DE number 7635221
- Applications of finite fields to combinatorics and finite geometries
- Binomial permutations of finite fields
- Combinatorial problems in finite fields and Sidon sets
- Constructions of Involutions Over Finite Fields
- scientific article; zbMATH DE number 953228
- scientific article; zbMATH DE number 1504683
- A combinatorial construction for products of linear transformations over a finite field
- Partitions and compositions over finite fields
Cites work
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1229678 (Why is no real title available?)
- scientific article; zbMATH DE number 1455120 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- A new table of constant weight codes
- APN permutations on \(\mathbb Z_n\) and Costas arrays
- Algebraic constructions for Costas arrays
- Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map
- An application of permutatation arrays to block ciphers
- An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
- Bounds for permutation arrays
- Constructing new covering arrays from LFSR sequences over finite fields
- Construction of complete sets of mutually equiorthogonal frequency hypercubes
- Constructions for permutation codes in powerline communications
- Covering arrays from cyclotomy
- Covering arrays of higher strength from permutation vectors
- Divisibility of polynomials over finite fields and combinatorial applications
- Division of trinomials by pentanomials and orthogonal arrays
- Frequency permutation arrays
- Handbook of finite fields
- On periodicity properties of Costas arrays and a conjecture on permutation polynomials
- On the Nonlinearity of Exponential Welch Costas Functions
- On the characterization of a semi-multiplicative analogue of planar functions over finite fields
- Ordered Orthogonal Array Construction Using LFSR Sequences
- Orthogonal Arrays of Index Unity
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Orthogonal arrays. Theory and applications
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Point sets and sequences with small discrepancy
- Point sets with uniformity properties and orthogonal hypercubes
- Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
- Properties of complete sets of mutually equiorthogonal frequency hypercubes
- Results of the enumeration of costas arrays of order 29
- Sets of orthogonal hypercubes of class \(r\)
- Strong forms of orthogonality for sets of frequency hypercubes
- Strong forms of orthogonality for sets of hypercubes
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- The CRC handbook of combinatorial designs
- The Deficiency of Costas Arrays
- The Status of Costas Arrays
- The enumeration of Costas arrays of order 28 and its consequences
- The geometry of sets of orthogonal frequency hypercubes
- Two New Measures for Permutations: Ambiguity and Deficiency
Cited in
(8)- Arrays for combinatorial interaction testing: a review on constructive approaches
- scientific article; zbMATH DE number 6531818 (Why is no real title available?)
- Circular Tuscan-\(k\) arrays from permutation binomials
- Covering arrays from \(m\)-sequences and character sums
- The combinatorics of generalised cumulative arrays
- Ordered covering arrays and upper bounds on covering codes
- Tail fields of partially exchangeable arrays
- Constructing new covering arrays from LFSR sequences over finite fields
This page was built for publication: Finite field constructions of combinatorial arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908047)
