A General Construction of Ordered Orthogonal Arrays Using LFSRs

DOI10.1109/TIT.2019.2894660zbMath1432.05021arXiv1805.10350OpenAlexW2962780102WikidataQ128502178 ScholiaQ128502178MaRDI QIDQ5224074

Daniel Panario, Mark Saaltink, Daniel Wevrick, Brett Stevens

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.10350

zbMATH Keywords

primitive polynomialslinear feedback shift register sequences (LFSRs)ordered orthogonal arrays (OOAs)

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 (2)

Existence of small ordered orthogonal arrays ⋮ Factorials experiments, covering arrays, and combinatorial testing

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