Completely transitive codes in Hamming graphs
From MaRDI portal
Publication:1817591
DOI10.1006/EUJC.1999.0313zbMATH Open0943.05042DBLPjournals/ejc/GiudiciP99OpenAlexW2009956376WikidataQ56988039 ScholiaQ56988039MaRDI QIDQ1817591FDOQ1817591
Michael Giudici, Cheryl E. Praeger
Publication date: 2 March 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0313
Recommendations
Cites Work
Cited In (28)
- On a family of binary completely transitive codes with growing covering radius
- Alphabet-almost-simple 2-neighbour-transitive codes
- Embedding permutation groups into wreath products in product action
- On existence of perfect bitrades in Hamming graphs
- On completely regular codes
- Entry-faithful 2-neighbour transitive codes
- About non equivalent completely regular codes with identical intersection array
- Conway groupoids and completely transitive codes
- A new distance-regular graph of diameter 3 on 1024 vertices
- \(s\)-elusive codes in Hamming graphs
- The subconstituent algebra of a strongly regular graph
- Completely regular codes by concatenating Hamming codes
- Neighbour transitivity on codes in Hamming graphs
- On new infinite families of completely regular and completely transitive codes
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- Neighbour-transitive codes in Kneser graphs
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- On completely regular and completely transitive supplementary codes
- Families of completely transitive codes and distance transitive graphs
- Diagonally neighbour transitive codes and frequency permutation arrays
- Conway’s groupoid and its relatives
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- On the classification of binary completely transitive codes with almost-simple top-group
- Characters and Brauer trees of the covering group of ²𝐸₆(2)
- Families of nested completely regular codes and distance-regular graphs
- Title not available (Why is that?)
- Completely regular codes with different parameters giving the same distance-regular coset graphs
Uses Software
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)
