Division of trinomials by pentanomials and orthogonal arrays

DOI10.1007/s10623-007-9052-yzbMath1141.94007OpenAlexW2131858589MaRDI 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 arraysshift-register sequence

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)

Related Items (7)

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

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

This page was built for publication: Division of trinomials by pentanomials and orthogonal arrays