Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
From MaRDI portal
Publication:5264765
DOI10.1134/S1990478915010159zbMATH Open1324.05047MaRDI QIDQ5264765FDOQ5264765
Denis S. Krotov, Konstantin Vorob'ev
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The theory and application of latin bitrades: A survey
- A product construction for perfect codes over arbitrary alphabets (Corresp.)
- Multidimensional Latin bitrades
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On the structure of non-full-rank perfect \(q\)-ary codes
- Perfect binary codes: constructions, properties, and enumeration
- Structure of \(i\)-components of perfect binary codes
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
Cited In (12)
- Minimum supports of functions on the Hamming graphs with spectral constraints
- On existence of perfect bitrades in Hamming graphs
- The extended 1-perfect trades in small hypercubes
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Optimal functions with spectral constraints in hypercubes
- 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
- Minimum supports of eigenfunctions in bilinear forms graphs
- Minimum supports of eigenfunctions of Hamming graphs
- To the theory of \(q\)-ary Steiner and other-type trades
- Minimum supports of eigenfunctions of graphs: a survey
This page was built for publication: Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264765)
