Perfect 2‐colorings of Hamming graphs
From MaRDI portal
Publication:6186659
DOI10.1002/jcd.21771arXiv1911.13151OpenAlexW3133704031MaRDI QIDQ6186659
Anna A. Taranenko, Unnamed Author, Denis S. Krotov, Konstantin Vorob'ev, Evgeniĭ Andreevich Bespalov
Publication date: 2 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.13151
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Minimum supports of eigenfunctions of graphs: a survey ⋮ Phylogeny numbers of generalized Hamming graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On the binary codes with parameters of triply-shortened 1-perfect codes
- On calculation of the interweight distribution of an equitable partition
- On periodicity of perfect colorings of the infinite hexagonal and triangular grids
- On weight distributions of perfect colorings and completely regular codes
- Local duality for equitable partitions of a Hamming space
- Local and interweight spectra of completely regular codes and of perfect colorings
- On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
- Orthogonal arrays. Theory and applications
- Completely regular designs of strength one
- Problems in algebraic combinatorics
- Small additive quaternary codes.
- Local distributions for eigenfunctions and perfect colorings of \(q\)-ary Hamming graph
- Cycle-balance conditions for distance-regular graphs
- Tight sets and \(m\)-ovoids of generalised quadrangles
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- The non-existence of some perfect codes over non-prime power alphabets
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- Perfect 2-colorings of the Grassmann graph of planes
- On unbalanced Boolean functions with best correlation immunity
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Estimates of the capacity of orthogonal arrays of large strength
- On the binary codes with parameters of doubly-shortened 1-perfect codes
- On the Classification of MDS Codes
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
- Equitable partitions of Latin‐square graphs
- Rook domains, Latin squares, affine planes, and error-distributing codes
- On completely regular codes
This page was built for publication: Perfect 2‐colorings of Hamming graphs
