IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i17p6012-6029.html
   My bibliography  Save this article

Hamming distances of tight orthogonal arrays

Author

Listed:
  • Shanqi Pang
  • Mengqian Chen
  • Xiao Zhang

Abstract

Orthogonal arrays (OAs) are widely applied in the statistical design of experiments. The Hamming distances of OAs play an increasingly important role in various areas; however, it is difficult to use Hamming distances, especially for tight and mixed orthogonal arrays (MOAs). For example, two OAs with the same parameters may have distinct Hamming distances due to their different structures and constructions. In addition, studies on Hamming distances of tight OAs are scant, with the exception of a study indicating that a tight symmetrical OA of strength 2 has a constant Hamming distance. In this article, we calculate Hamming distances for high-strength OAs, including all tight symmetrical OAs of strength 3, 4, and 5. Interestingly, the Hamming distances do not depend on the constructions or structures of the arrays. Additionally, we study the Hamming distances of several classes of MOAs of strength 2 and 3, some of which are not related to the structures of the arrays.

Suggested Citation

  • Shanqi Pang & Mengqian Chen & Xiao Zhang, 2024. "Hamming distances of tight orthogonal arrays," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(17), pages 6012-6029, September.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:17:p:6012-6029
    DOI: 10.1080/03610926.2023.2239395
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2239395
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2023.2239395?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:53:y:2024:i:17:p:6012-6029. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.