Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs

DOI10.1134/S0037446620050109zbMath1448.05028OpenAlexW3090986818MaRDI QIDQ2202769

Vladimir N. Potapov, Sergei V. Avgustinovich

Publication date: 30 September 2020

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446620050109

zbMATH Keywords

Johnson graphbent functionsdifference setsGrassmann graphcombinatorial designsperfect coloringDelsarte-Hoffman bound\(q\)-analogs of combinatorial designstransversals of hypergraph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65) Cryptography (94A60) Other designs, configurations (05B30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items

Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Perfect colorings of the infinite square grid: coverings and twin colors

Cites Work

• On perfect 2-colorings of the \(q\)-ary \(n\)-cube
• To the theory of \(q\)-ary Steiner and other-type trades
• A survey of partial difference sets
• A bound on correlation immunity
• A family of difference sets in non-cyclic groups
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Bent Functions
• Unnamed Item
• Unnamed Item