The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2

Shanqi Pang, Xiao Zhang and Qingjuan Zhang

Communications in Statistics - Theory and Methods, 2020, vol. 49, issue 16, 3895-3910

Abstract: Orthogonal arrays have many connections to other combinatorial designs and are applied in coding theory, the statistical design of experiments, cryptography, various types of software testing and quality control. In this paper, we present some general methods to find the Hamming distances for saturated asymmetrical orthogonal arrays (SAOAs) with strength 2. As applications of our methods, the Hamming distances of SAOA parents of size less than or equal to 100 are obtained. We also provide the Hamming distances of the SAOAs constructed from difference schemes or by the expansive replacement method. The feasibility of Hamming distances is discussed.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2019.1591452 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:49:y:2020:i:16:p:3895-3910

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2019.1591452

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().