Completely transitive codes in Hamming graphs
From MaRDI portal
Publication:1817591
DOI10.1006/eujc.1999.0313zbMath0943.05042DBLPjournals/ejc/GiudiciP99OpenAlexW2009956376WikidataQ56988039 ScholiaQ56988039MaRDI QIDQ1817591
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
Related Items (26)
Entry-faithful 2-neighbour transitive codes ⋮ EMBEDDING PERMUTATION GROUPS INTO WREATH PRODUCTS IN PRODUCT ACTION ⋮ The subconstituent algebra of a strongly regular graph ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ On a family of binary completely transitive codes with growing covering radius ⋮ On new infinite families of completely regular and completely transitive codes ⋮ Neighbour-transitive codes in Kneser graphs ⋮ Neighbour transitivity on codes in Hamming graphs ⋮ Families of completely transitive codes and distance transitive graphs ⋮ On completely regular codes ⋮ On the Kronecker Product Construction of Completely Transitive q-Ary Codes ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ About non equivalent completely regular codes with identical intersection array ⋮ Completely regular codes with different parameters giving the same distance-regular coset graphs ⋮ Completely regular codes by concatenating Hamming codes ⋮ Conway groupoids and completely transitive codes ⋮ \(s\)-elusive codes in Hamming graphs ⋮ On completely regular and completely transitive supplementary codes ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ Minimal binary 2-neighbour-transitive codes ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ Families of nested completely regular codes and distance-regular graphs
Uses Software
Cites Work
This page was built for publication: Completely transitive codes in Hamming graphs
