We present a new construction of ordered orthogonal arrays (OOAs) of strength t with (q + 1)t columns over a finite field Fq using linear feedback shift register sequences (LFSRs). OOAs are naturally related to (t, m, s) -nets, linear codes, and MDS codes. Our construction selects suitable columns from the array formed by all subintervals of length qt-1/q-1 of an LFSR sequence generated by a primitive polynomial of degree t over Fq. We prove properties about the relative positions of runs in an LFSR, which guarantee that the constructed OOA has strength t. The set of parameters of our OOAs are the same as the ones given by Rosenbloom and Tsfasman (1997) and Skriganov (2002), but the constructed arrays are different. We experimentally verify that our OOAs are stronger than the Rosenbloom-Tsfasman-Skriganov OOAs in the sense that ours are "closer" to being a "full" orthogonal array. We also discuss how our OOA construction relates to previous techniques to build OOAs from a set of linearly independent vectors over Fq, as well as to hypergraph homomorphisms.

Additional Metadata
Keywords hypergraph homomorphisms, linear feedback shift registers, Ordered orthogonal arrays, runs in LFSR sequences
Persistent URL dx.doi.org/10.1109/TIT.2016.2634010
Journal IEEE Transactions on Information Theory
Citation
Castoldi, A.G. (André Guerino), Moura, L. (Lucia), Panario, D, & Stevens, B. (2017). Ordered Orthogonal Array Construction Using LFSR Sequences. IEEE Transactions on Information Theory, 63(2), 1336–1347. doi:10.1109/TIT.2016.2634010