Abstract
We show how one can use polynomial techniques to compute all possible distance distributions of binary orthogonal arrays (OAs) of relatively small lengths and strengths. Then we exploit certain connections between OAs and their derived OAs. Having all distance distributions of OAs under consideration, we are able to test them aimed at classification results.
Similar content being viewed by others
References
Hedayat, A.S., Sloane, N.J.A., and Stufken, J., Orthogonal Arrays: Theory and Applications, New York: Springer, 1999.
Levenshtein, V.I., Universal Bounds for Codes and Designs, Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, vol. I, ch. 6, pp. 499–648.
Handbook of Mathematical Functions, with Formulas, Graphs, and Mathematical Tables, Abramowitz, M. and Stegun, I.A., Eds., New York: Dover, 1965. Translated under the title Spravochnik po spetsial’nym funktsiyam s formulami, grafikami i matematicheskimi tablitsami, Moscow: Nauka, 1979.
Boyvalenkov, P. and Kulina, H., Computing Distance Distributions of Orthogonal Arrays, in Proc. 12th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT’2010), Academgorodok, Novosibirsk, Russia, Novosibirsk: Sobolev Inst. Math., 2010, P. 82–85.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Stefan Dodunekov (September 5, 1945–August 5, 2012)
Original Russian Text © P. Boyvalenkov, H. Kulina, 2013, published in Problemy Peredachi Informatsii, 2013, Vol. 49, No. 4, pp. 28–40.
Supported by the Bulgarian NSF, contract no. I01/0003.
Supported in part by the NPD, Plovdiv University, project no. NI13 FMI02.
Rights and permissions
About this article
Cite this article
Boyvalenkov, P., Kulina, H. Investigation of binary orthogonal arrays via their distance distributions. Probl Inf Transm 49, 322–332 (2013). https://doi.org/10.1134/S0032946013040030
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946013040030