Division of trinomials by pentanomials and orthogonal arrays (Q2384052): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Four fundamental parameters of a code and their combinatorial significance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Division of trinomials by pentanomials and orthogonal arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Irreducible trinomials over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primitive Polynomials Over Finite Fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Distribution of Sums of Successive Bits of Shift-Register Sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4301239 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primitive Normal Polynomials Over Finite Fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthogonal arrays, primitive trinomials, and shift-register sequences / rank | |||
Normal rank |
Latest revision as of 17:31, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Division of trinomials by pentanomials and orthogonal arrays |
scientific article |
Statements
Division of trinomials by pentanomials and orthogonal arrays (English)
0 references
20 September 2007
0 references
The authors study a maximum-length binary shift-register sequence generated by a primitive pentanomial \(f\) of degree \(m\). Let \(C_n^f\) denote the set of all subintervals of the sequence with length \(n\) and the zero vector of length \(n.\) It is a linear subspace of dimension \(m\), if \(n>m\). In the case when \(f\) is a trinomial, \textit{A. Munemasa} [Finite Fields Appl. 4, No. 3, 252--260 (1998; Zbl 0978.94037)] proved that \(C_n^f\) is an orthogonal array of strength 2 that has a property very close to being an orthogonal array of strength 3. Munemasa's result was based on his proof that very few trinomials of degree at most \(2m\) are divisible by the given trinomial \(f\). In this paper the authors consider the case \(m<n\leq2m.\) Their main result is that no trinomial of degree at most \(2m\) is divisible by the given pentanomial \(f\), provided that \(f\) is not in a finite list of exceptions. As a corollary, the authors conclude that \(C_n^f\) is an orthogonal array of strength 3, if \(f\) is primitive and does not belong to the list of exceptions.
0 references
shift-register sequence
0 references
orthogonal arrays
0 references