Division of trinomials by pentanomials and orthogonal arrays

DOI10.1007/s10623-007-9052-yzbMath1141.94007MaRDI QIDQ2384052

Lucia Moura, Michael Dewar, Brett Stevens, Daniel Panario, Qiang Wang

Publication date: 20 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10623-007-9052-y

zbMATH Keywords

orthogonal arrays; shift-register sequence

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

Related Items

Divisibility of polynomials over finite fields and combinatorial applications, 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\)], Division of trinomials by pentanomials and orthogonal arrays

Cites Work

• Unnamed Item
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Division of trinomials by pentanomials and orthogonal arrays
• Primitive Polynomials Over Finite Fields
• Primitive Normal Polynomials Over Finite Fields
• Irreducible trinomials over finite fields
• Four fundamental parameters of a code and their combinatorial significance
• On the Distribution of Sums of Successive Bits of Shift-Register Sequences