On existence of perfect bitrades in Hamming graphs

DOI10.1016/j.disc.2020.112128zbMath1458.05200arXiv1912.09089OpenAlexW3081628710MaRDI QIDQ2005721

Ivan Yu. Mogilnykh, Faina I. Solov'eva

Publication date: 8 October 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.09089

zbMATH Keywords

alternating groupperfect codeMDS codeone-error-correcting codeperfect bitradespherical bitrade

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Minimum supports of eigenfunctions of graphs: a survey ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional Latin bitrades
• Minimum supports of eigenfunctions of Hamming graphs
• Spectra of graphs
• Switching codes and designs
• To the theory of \(q\)-ary Steiner and other-type trades
• On the structure of (v,k,t) trades
• Switching equivalence classes of perfect codes
• Minimum supports of functions on the Hamming graphs with spectral constraints
• The extended 1-perfect trades in small hypercubes
• ELUSIVE CODES IN HAMMING GRAPHS
• On the Number of $1$-Perfect Binary Codes: A Lower Bound
• On Perfect Codes and Tilings: Problems and Solutions
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• On the Nonexistence of Perfect Codes over Finite Fields
• A survey of perfect codes

This page was built for publication: On existence of perfect bitrades in Hamming graphs