Covering arrays from \(m\)-sequences and character sums
type: Item
instance of: scholarly article
title: Covering arrays from \(m\)-sequences and character sums
zbMATH Open document ID: 1418.05041
author: Georgios Tzanakis
author: Lucia Moura
author: Daniel Panario
author: Brett Stevens
published in: Designs, Codes and Cryptography
publication date: 2017-10-27T00:00:00Z
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11T23
zbMATH DE Number: 6798857
zbMATH Keywords: covering arrays
zbMATH Keywords: linear feedback shift register sequences
zbMATH Keywords: primitive polynomials over finite fields
zbMATH Keywords: characters over finite fields
zbMATH Keywords: character sums
describes a project that uses: SageMath
describes a project that uses: AMDS
MaRDI profile type: Publication
full work available at URL: s10623-016-0316-2
OpenAlex ID: W2563142603
cites work: Maximal AMDS codes
cites work: Q4382830
cites work: Q5796828
cites work: Q3594048
cites work: Covering arrays from cyclotomy
cites work: Q4873725
cites work: Almost MDS codes
cites work: Division of trinomials by pentanomials and orthogonal arrays
cites work: Partitioning Projective Geometries into Caps
cites work: On the extendibility of near-MDS elliptic codes
cites work: Q5713307
cites work: Orthogonal arrays. Theory and applications
cites work: Q4550672
cites work: Two applications (for search theory and truth functions) of Sperner type theorems
cites work: Division of tetranomials by type II pentanomials and orthogonal arrays
cites work: Families of \(k\)-independent sets
cites work: Q5690468
cites work: Finite field constructions of combinatorial arrays
cites work: Handbook of finite fields
cites work: Orthogonal arrays, primitive trinomials, and shift-register sequences
cites work: Divisibility of polynomials over finite fields and combinatorial applications
cites work: Q5815962
cites work: A construction for strength-3 covering arrays from linear feedback shift register sequences
cites work: Q5603638
cites work: Q3997777
cites work: Constructing new covering arrays from LFSR sequences over finite fields
DOI: 10.1007/S10623-016-0316-2
Recommended article: On perfect sequence covering arrays
Recommended article: Sequence Covering Arrays and Linear Extensions
Recommended article: On \(t\)-covering arrays
Recommended article: Q3594048
Recommended article: Sequence Covering Arrays
Recommended article: Covering arrays via set covers
Recommended article: Covering the integers by arithmetic sequences
Recommended article: Covering arrays from cyclotomy
Recommended article: Recursive constructions for \(t\)-covering arrays
Recommended article: A group-based structure for perfect sequence covering arrays
description: scientific article; zbMATH DE number 6798857