Completely regular codes in Johnson and Grassmann graphs with small covering radii
From MaRDI portal
Publication:2152798
DOI10.37236/10083zbMath1492.05022arXiv2012.06970OpenAlexW3111291503MaRDI QIDQ2152798
Publication date: 11 July 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06970
Linear codes (general theory) (94B05) Other designs, configurations (05B30) Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25)
Related Items (2)
On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Degree 2 Boolean functions on Grassmann graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cameron-Liebler line classes in \(PG(n,4)\)
- Intriguing sets of vertices of regular graphs
- On weight distributions of perfect colorings and completely regular codes
- Induced perfect colorings
- Completely regular codes
- Completely regular designs of strength one
- Boolean degree 1 functions on some classical association schemes
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- Tactical decompositions and orbits of projective groups
- Cycle-balance conditions for distance-regular graphs
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
- Perfect 2-colorings of the Grassmann graph of planes
- On incidence matrices of finite projective and affine spaces
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- Completely regular designs
- On completely regular codes
This page was built for publication: Completely regular codes in Johnson and Grassmann graphs with small covering radii
