Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

DOI10.1134/S1990478915010159zbMath1324.05047MaRDI QIDQ5264765

Denis S. Krotov, Konstantin Vorob'ev

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamming graphKrawtchouk polynomialKravchuk polynomial1-perfect bitrade

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Minimum supports of eigenfunctions of graphs: a survey, Minimum supports of eigenfunctions in bilinear forms graphs, Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs, On the minimum supports of some eigenfunctions in the Doob graphs, Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph, To the theory of \(q\)-ary Steiner and other-type trades, Optimal functions with spectral constraints in hypercubes, Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph, Minimum supports of functions on the Hamming graphs with spectral constraints, Minimum supports of eigenfunctions of Hamming graphs, On existence of perfect bitrades in Hamming graphs, The extended 1-perfect trades in small hypercubes

Cites Work

• Unnamed Item
• Multidimensional Latin bitrades
• On perfect 2-colorings of the \(q\)-ary \(n\)-cube
• On the structure of non-full-rank perfect \(q\)-ary codes
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• A product construction for perfect codes over arbitrary alphabets (Corresp.)
• The theory and application of latin bitrades: A survey
• Perfect binary codes: constructions, properties, and enumeration
• Structure of \(i\)-components of perfect binary codes