Covering arrays from \(m\)-sequences and character sums

DOI10.1007/s10623-016-0316-2zbMath1418.05041OpenAlexW2563142603MaRDI QIDQ1675282

Daniel Panario, Lucia Moura, Georgios Tzanakis, Brett Stevens

Publication date: 27 October 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0316-2

zbMATH Keywords

character sumscovering arraysprimitive polynomials over finite fieldslinear feedback shift register sequencescharacters over finite fields

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) Polynomials over finite fields (11T06) Exponential sums (11T23) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Consecutive detecting arrays for interaction faults ⋮ Comparing balanced sequences obtained from ElGamal function to random balanced sequences ⋮ Number of \(t\)-tuples in arrays from LFSRs ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches

Uses Software

• SageMath
• AMDS

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
• Division of tetranomials by type II pentanomials and orthogonal arrays
• Almost MDS codes
• Constructing new covering arrays from LFSR sequences over finite fields
• Finite field constructions of combinatorial arrays
• Covering arrays from cyclotomy
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Orthogonal arrays. Theory and applications
• On the extendibility of near-MDS elliptic codes
• Division of trinomials by pentanomials and orthogonal arrays
• Maximal AMDS codes
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Handbook of Finite Fields
• Partitioning Projective Geometries into Caps

This page was built for publication: Covering arrays from \(m\)-sequences and character sums