Abstract
We improve the available upper and lower bounds for the minimal size of the support of an eigenfunction of the Hamming graph H(n, q), where q > 2. In particular, the size of a minimal 1-perfect bitrade in H(n, q) is estimated. We show that the size of such a bitrade is at least 2n−(n−1)/q(q − 2)(n−1)/q for q ≥ 4 and 3n/2(1 − O(1/n)) for q = 3. Moreover, for n ≡ 1 mod q, where q is a prime power, we propose a construction of bitrades of size q (q−2)(n−1)/q2(n−1)/q+1.
Similar content being viewed by others
References
P. Delsarte, An Algebraic Approach to the Association Schemes of Coding Theory (N. V. Philips’ Gloeilampenfabrieken, Eindhoven, 1973; Mir, Moscow, 1976).
V. N. Potapov, “Multidimensional Latin Bitrades,” Sibirsk. Mat. Zh. 54(2), 407–416 (2013) [Siberian Math. J. 54 (2), 317–324 (2013)].
N. J. Cavenagh, “The Theory and Application of Latin Bitrades: a Survey,” Math. Slovaca. 58(6), 691–718 (2008).
T. Etzion and A. Vardy, “Perfect Binary Codes: Constructions, Properties, and Enumeration,” IEEE Trans. Inform. Theory 40(3), 754–763 (1994).
A. S. Hedayat and G. B. Khosrovshahi, “Trades,” in CRC Handbook of Combinatorial Designs (Chapman and Hall/CRC, Boca Raton, 2006), pp. 644–648.
O. Heden and D. S. Krotov, “On the Structure of Non-Full-Rank Perfect q-Ary Codes,” Adv. Math. Comm. 5(2), 149–156 (2011).
K. T. Phelps, “A Product Construction for Perfect Codes over Arbitrary Alphabets,” IEEE Trans. Inform. Theory 30(5), 769–771 (1984).
K. T. Phelps, J. Rifà, and M. Villanueva, “Kernels and p-Kernels of p r-Ary 1-Perfect Codes,” Des. Codes Cryptogr. 37(2), 243–261 (2005).
V. N. Potapov, “On Perfect 2-Colorings of the q-Ary n-Cube,” Discrete Math. 312(6), 1269–1272 (2012).
F. I. Solov’eva, “Structure of i-Components of PerfectBinary Codes,” Discrete Appl. Math. 111(1–2), 189–197 (2001).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © K.V. Vorob’ev, D.S. Krotov, 2014, published in Diskretnyi Analiz i Issledovanie Operatsii, 2014, Vol. 21, No. 6, pp. 3–10.
Rights and permissions
About this article
Cite this article
Vorob’ev, K.V., Krotov, D.S. Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph. J. Appl. Ind. Math. 9, 141–146 (2015). https://doi.org/10.1134/S1990478915010159
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478915010159