Orthogonal arrays, primitive trinomials, and shift-register sequences

DOI10.1006/ffta.1998.0213zbMath0978.94037OpenAlexW1998893218MaRDI QIDQ1273727

Akihiro Munemasa

Publication date: 2 June 1999

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1998.0213

zbMATH Keywords

orthogonal arraysshift-register sequencessubintervals

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

Division of trinomials by pentanomials and orthogonal arrays, Covering arrays from \(m\)-sequences and character sums, A construction for strength-3 covering arrays from linear feedback shift register sequences, 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, Irreducible trinomials over finite fields, Division of tetranomials by type II pentanomials and orthogonal arrays, General results on the divisibility of low weight polynomials in \(\mathbb{F}_q [x\)], Arrays for combinatorial interaction testing: a review on constructive approaches, Efficient linear feedback shift registers with maximal period

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of multiples of certain primitive polynomials over GF(2)
• Four fundamental parameters of a code and their combinatorial significance
• On the Distribution of Sums of Successive Bits of Shift-Register Sequences