RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2020 Volume 56, Issue 1, Pages 51–62 (Mi ppi2311)

This article is cited in 4 papers

Coding Theory

On distance distributions of orthogonal arrays

N. L. Manev

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria

Abstract: Orthogonal arrays play an important role in statistics and experimental design. Like other combinatorial constructions, the most important and studied problems are questions about their existence and classification. An essential step to solving such problems is determination of Hamming distance distributions of an orthogonal array with given parameters. In this paper we propose an algorithm for computing possible distance distributions of an orthogonal array with arbitrary parameters with respect to any vector of the space. The possible distance distributions are all nonnegative integer solutions of special linear systems with integer coefficients. The proposed algorithm reduces the problem to checking signs of only $t + 1$ coordinates of vectors of a subset of integer solutions of the system.

Keywords: orthogonal arrays, Hamming distance distribution, nonnegative integer solution of a linear system.

UDC: 621.391.15

Received: 26.03.2019
Revised: 05.12.2019
Accepted: 22.12.2019

DOI: 10.31857/S0555292320010052


 English version:
Problems of Information Transmission, 2020, 56:1, 45–55

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026