Finite field constructions of combinatorial arrays
From MaRDI portal
Publication:908047
DOI10.1007/s10623-015-0152-9zbMath1332.05026OpenAlexW2210308629MaRDI QIDQ908047
Lucia Moura, Gary L. Mullen, Daniel Panario
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0152-9
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
Covering arrays from \(m\)-sequences and character sums, Ordered covering arrays and upper bounds on covering codes, Arrays for combinatorial interaction testing: a review on constructive approaches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Divisibility of polynomials over finite fields and combinatorial applications
- Strong forms of orthogonality for sets of hypercubes
- The enumeration of Costas arrays of order 28 and its consequences
- Point sets and sequences with small discrepancy
- Results of the enumeration of costas arrays of order 29
- Sets of orthogonal hypercubes of class \(r\)
- Algebraic constructions for Costas arrays
- Constructing new covering arrays from LFSR sequences over finite fields
- APN permutations on \(\mathbb Z_n\) and Costas arrays
- Covering arrays from cyclotomy
- Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
- Point sets with uniformity properties and orthogonal hypercubes
- Bounds for permutation arrays
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Properties of complete sets of mutually equiorthogonal frequency hypercubes
- Orthogonal arrays. Theory and applications
- Construction of complete sets of mutually equiorthogonal frequency hypercubes
- Constructions for permutation codes in powerline communications
- An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
- Division of trinomials by pentanomials and orthogonal arrays
- Handbook of Finite Fields
- The Deficiency of Costas Arrays
- Ordered Orthogonal Array Construction Using LFSR Sequences
- On the characterization of a semi-multiplicative analogue of planar functions over finite fields
- A new table of constant weight codes
- Frequency permutation arrays
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- The Status of Costas Arrays
- A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
- On periodicity properties of Costas arrays and a conjecture on permutation polynomials
- Two New Measures for Permutations: Ambiguity and Deficiency
- On the Nonlinearity of Exponential Welch Costas Functions
- Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map
- The geometry of sets of orthogonal frequency hypercubes
- Covering arrays of higher strength from permutation vectors
- Orthogonal Arrays of Index Unity
