Completely transitive codes in Hamming graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Completely regular codes
- Completely regular codes and completely transitive codes
- Problems in algebraic combinatorics
Cited in
(29)- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- Characters and Brauer trees of the covering group of \({{}^2E_6(2)}\)
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- On a family of binary completely transitive codes with growing covering radius
- On completely regular codes
- On existence of perfect bitrades in Hamming graphs
- Alphabet-almost-simple 2-neighbour-transitive codes
- \(s\)-elusive codes in Hamming graphs
- Entry-faithful 2-neighbour transitive codes
- Embedding permutation groups into wreath products in product action
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Families of nested completely regular codes and distance-regular graphs
- Minimal binary 2-neighbour-transitive codes
- Neighbour transitivity on codes in Hamming graphs
- Neighbour-transitive codes in Kneser graphs
- On the classification of binary completely transitive codes with almost-simple top-group
- Families of completely transitive codes and distance transitive graphs
- Conway groupoids and completely transitive codes
- On new infinite families of completely regular and completely transitive codes
- scientific article; zbMATH DE number 177889 (Why is no real title available?)
- The subconstituent algebra of a strongly regular graph
- Elusive codes in Hamming graphs
- Diagonally neighbour transitive codes and frequency permutation arrays
- About non equivalent completely regular codes with identical intersection array
- A new distance-regular graph of diameter 3 on 1024 vertices
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- Completely regular codes by concatenating Hamming codes
- Conway's groupoid and its relatives
- On completely regular and completely transitive supplementary codes
This page was built for publication: Completely transitive codes in Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817591)
