Finite field constructions of combinatorial arrays

DOI10.1007/S10623-015-0152-9zbMATH Open1332.05026OpenAlexW2210308629MaRDI QIDQ908047FDOQ908047

Authors: 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

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

zbMATH Keywords

hypercubeCostas arrayorthogonal arrayordered orthogonal arraycovering arraypermutation array

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Title not available (Why is that?)
• Orthogonal arrays. Theory and applications
• The CRC handbook of combinatorial designs
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthogonal Arrays of Index Unity
• Handbook of finite fields
• The enumeration of Costas arrays of order 28 and its consequences
• Title not available (Why is that?)
• Results of the enumeration of costas arrays of order 29
• Algebraic constructions for Costas arrays
• Title not available (Why is that?)
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• Title not available (Why is that?)
• A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
• Point sets and sequences with small discrepancy
• Bounds for permutation arrays
• Constructions for permutation codes in powerline communications
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• A new table of constant weight codes
• An application of permutatation arrays to block ciphers
• Strong forms of orthogonality for sets of frequency hypercubes
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Division of trinomials by pentanomials and orthogonal arrays
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Divisibility of polynomials over finite fields and combinatorial applications
• Frequency permutation arrays
• Strong forms of orthogonality for sets of hypercubes
• Sets of orthogonal hypercubes of class \(r\)
• On the Nonlinearity of Exponential Welch Costas Functions
• APN permutations on \(\mathbb Z_n\) and Costas arrays
• The Deficiency of Costas Arrays
• The Status of Costas Arrays
• Point sets with uniformity properties and orthogonal hypercubes
• Covering arrays of higher strength from permutation vectors
• Covering arrays from cyclotomy
• The geometry of sets of orthogonal frequency hypercubes
• Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
• On the characterization of a semi-multiplicative analogue of planar functions over finite fields
• Constructing new covering arrays from LFSR sequences over finite fields
• Properties of complete sets of mutually equiorthogonal frequency hypercubes
• Construction of complete sets of mutually equiorthogonal frequency hypercubes
• Ordered Orthogonal Array Construction Using LFSR Sequences
• On periodicity properties of Costas arrays and a conjecture on permutation polynomials
• Two New Measures for Permutations: Ambiguity and Deficiency
• Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map

Cited In (8)

• The combinatorics of generalised cumulative arrays
• Title not available (Why is that?)
• Tail fields of partially exchangeable arrays
• Circular Tuscan-\(k\) arrays from permutation binomials
• Constructing new covering arrays from LFSR sequences over finite fields
• Ordered covering arrays and upper bounds on covering codes
• Covering arrays from \(m\)-sequences and character sums
• Arrays for combinatorial interaction testing: a review on constructive approaches

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)