On perfect 2-colorings of the \(q\)-ary \(n\)-cube
From MaRDI portal
Publication:409480
DOI10.1016/j.disc.2011.12.004zbMath1245.05051arXiv1104.1293OpenAlexW2169084983MaRDI QIDQ409480
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1293
Related Items
On the non-existence of extended 1-perfect codes and MDS codes ⋮ 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 ⋮ Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph ⋮ Perfect 2‐colorings of Hamming graphs ⋮ Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs ⋮ Perfect colorings of the infinite square grid: coverings and twin colors ⋮ 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 \(q\)-ary bent and plateaued functions ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ On unbalanced Boolean functions with best correlation immunity ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranks of \(q\)-ary 1-perfect codes
- On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Construction of perfect \(q\)-ary codes by switchings of simple components
- 10.17686/sced_rusnauka_2008-1040
- Bounds on orthogonal arrays and resilient functions
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
