Covering arrays from m-sequences and character sums
DOI10.1007/S10623-016-0316-2zbMATH Open1418.05041OpenAlexW2563142603MaRDI QIDQ1675282FDOQ1675282
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
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
character sumscovering arraysprimitive polynomials over finite fieldslinear feedback shift register sequencescharacters over finite fields
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)
Cites Work
- Orthogonal arrays. Theory and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Handbook of finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Almost MDS codes
- On the extendibility of near-MDS elliptic codes
- 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
- Partitioning Projective Geometries into Caps
- Division of tetranomials by type II pentanomials and orthogonal arrays
- Covering arrays from cyclotomy
- Title not available (Why is that?)
- Constructing new covering arrays from LFSR sequences over finite fields
- Finite field constructions of combinatorial arrays
- Maximal AMDS codes
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
- Comparing balanced sequences obtained from ElGamal function to random balanced sequences
- Consecutive detecting arrays for interaction faults
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Sequence Covering Arrays and Linear Extensions
Uses Software
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)
