Divisibility of polynomials over finite fields and combinatorial applications

DOI10.1007/s10623-011-9565-2zbMath1255.12003MaRDI QIDQ411500

Olga Sosnovski, Brett Stevens, Daniel Panario, Qiang Wang

Publication date: 4 April 2012

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

Full work available at URL: https://doi.org/10.1007/s10623-011-9565-2

zbMATH Keywords

orthogonal arrays; polynomials over finite fields; divisibility of polynomials

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

05B15: Orthogonal arrays, Latin squares, Room squares

11T06: Polynomials over finite fields

12E20: Finite fields (field-theoretic aspects)

Related Items

Division of tetranomials by type II pentanomials and orthogonal arrays, Constructing new covering arrays from LFSR sequences over finite fields, Finite field constructions of combinatorial arrays, Covering arrays from \(m\)-sequences and character sums, General results on the divisibility of low weight polynomials in \(\mathbb{F}_q [x\)]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• The test suite generation problem: optimal instances and their implications
• Division of trinomials by pentanomials and orthogonal arrays
• Covering arrays on graphs
• Results on multiples of primitive polynomials and their products over GF(2)
• Shift Register Sequences – A Retrospective Account
• $\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
• A Practical Key Recovery Attack on Basic TCHo
• Four fundamental parameters of a code and their combinatorial significance
• Mixed covering arrays on graphs
• On the Distribution of Sums of Successive Bits of Shift-Register Sequences