Covering arrays from m-sequences and character sums

DOI10.1007/S10623-016-0316-2MaRDI QIDQ1675282zbMATH OpenOpenAlexFDO

Authors Georgios Tzanakis, Lucia Moura, Daniel Panario, 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) Combinatorial aspects of packing and covering (05B40) Exponential sums (11T23)

Recommendations

• On perfect sequence covering arrays
• Sequence Covering Arrays and Linear Extensions
• On t-covering arrays
• scientific article; zbMATH DE number 5177325
• Sequence covering arrays
• Covering arrays via set covers
• Covering the integers by arithmetic sequences
• Covering arrays from cyclotomy
• Recursive constructions for \(t\)-covering arrays
• A group-based structure for perfect sequence covering arrays

Cites work

• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3323559 (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?)
• scientific article; zbMATH DE number 3057679 (Why is no real title available?)
• scientific article; zbMATH DE number 3076999 (Why is no real title available?)
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Almost MDS codes
• Constructing new covering arrays from LFSR sequences over finite fields
• Covering arrays from cyclotomy
• Divisibility of polynomials over finite fields and combinatorial applications
• Division of tetranomials by type II pentanomials and orthogonal arrays
• Division of trinomials by pentanomials and orthogonal arrays
• Families of \(k\)-independent sets
• Finite field constructions of combinatorial arrays
• Handbook of finite fields
• Maximal AMDS codes
• On the extendibility of near-MDS elliptic codes
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Orthogonal arrays. Theory and applications
• Partitioning Projective Geometries into Caps
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(7)

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Number of \(t\)-tuples in arrays from LFSRs
• Constructing new covering arrays from LFSR sequences over finite fields
• Consecutive detecting arrays for interaction faults
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Comparing balanced sequences obtained from ElGamal function to random balanced sequences
• Sequence Covering Arrays and Linear Extensions

Describes a project that uses

Uses Software

• AMDS
• SageMath

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675282)