A General Construction of Ordered Orthogonal Arrays Using LFSRs

Orthogonal arrays, Latin squares, Room squares (05B15) Polynomials over finite fields (11T06) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Abstract: In cite{Castoldi},

ordered orthogonal arrays (OOAs) of strength

t

over the alphabet

F F_{q}

were constructed using linear feedback shift register sequences (LFSRs) defined by {em primitive} polynomials in

F F_{q} [x]

. In this paper we extend this result to all polynomials in

F F_{q} [x]

which satisfy some fairly simple restrictions, restrictions that are automatically satisfied by primitive polynomials. While these restrictions sometimes reduce the number of columns produced from

(q + 1) t

to a smaller multiple of

t

, in many cases we still obtain the maximum number of columns in the constructed OOA when using non-primitive polynomials. For small values of

q

and

t

, we generate OOAs in this manner for all permissible polynomials of degree

t

in

F F_{q} [x]

and compare the results to the ones produced in cite{Castoldi}, cite{Rosenbloom} and cite{Skriganov} showing how close the arrays are to being "full" orthogonal arrays. Unusually for finite fields, our arrays based on non-primitive irreducible and even reducible polynomials are closer to orthogonal arrays than those built from primitive polynomials.

Cited in

(2)

This page was built for publication: A General Construction of Ordered Orthogonal Arrays Using LFSRs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224074)