EconPapers    
Economics at your fingertips  
 

Hamming distances of unsaturated orthogonal arrays

Shanqi Pang, Mengqian Chen and Rong Yan

Communications in Statistics - Theory and Methods, 2025, vol. 54, issue 13, 3761-3789

Abstract: Orthogonal arrays (OAs) are applied in the statistical design of experiments, coding theory, cryptography, various types of software testing and quality control and have many connections to other combinatorial designs. The Hamming distances of OAs play a critical role in many areas such as algebraic combinatorics, quantum information theory, and wireless sensor networks. However, the calculation method of Hamming distances is difficult, especially for mixed orthogonal arrays (MOAs), since they rely on constructions or structures of OAs in many cases. In this article, by using the number of coincidences, we find some OAs with high strength and MOAs with strength 2 and 3, whose Hamming distances do not depend on their structures. We also calculate Hamming distances of a series of unsaturated asymmetrical OAs via their construction methods such as deleting columns, the expansive replacement method, and difference schemes.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2024.2405736 (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:54:y:2025:i:13:p:3761-3789

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

DOI: 10.1080/03610926.2024.2405736

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

 
Page updated 2025-06-03
Handle: RePEc:taf:lstaxx:v:54:y:2025:i:13:p:3761-3789