The following pages link to On completely regular codes (Q5970864):
Displaying 18 items.
- \(s\)-elusive codes in Hamming graphs (Q2034987) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- A new construction of two-, three- and few-weight codes via our GU codes and their applications (Q2100108) (← links)
- On the non-existence of extended 1-perfect codes and MDS codes (Q2120824) (← links)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii (Q2152798) (← links)
- Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph (Q2182001) (← links)
- On \(q\)-ary codes with two distances \(d\) and \(d+1\) (Q2190983) (← links)
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue (Q2198380) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Neighbour-transitive codes and partial spreads in generalised quadrangles (Q2672306) (← links)
- Perfect colorings of the infinite square grid: coverings and twin colors (Q2699652) (← links)
- Minimum supports of eigenfunctions of graphs: a survey (Q5888902) (← links)
- On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848) (← links)
- On the classification of completely regular codes with covering radius two and antipodal duals (Q6125767) (← links)
- Perfect 2‐colorings of Hamming graphs (Q6186659) (← links)
- On new infinite families of completely regular and completely transitive codes (Q6197705) (← links)
- Neighbour-transitive codes in Kneser graphs (Q6201495) (← links)
- The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes (Q6204340) (← links)
