Sporadic neighbour-transitive codes in Johnson graphs
From MaRDI portal
Publication:2249651
DOI10.1007/s10623-013-9853-0zbMath1294.05093arXiv1308.0398OpenAlexW2008146091WikidataQ56987458 ScholiaQ56987458MaRDI QIDQ2249651
Max Neunhöffer, Cheryl E. Praeger
Publication date: 3 July 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.0398
Extremal problems in graph theory (05C35) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other types of codes (94B60) Distance in graphs (05C12)
Related Items
Regularity and planarity of token graphs, Edge-transitive token graphs, Neighbour-transitive codes and partial spreads in generalised quadrangles, Neighbour-transitive codes in Kneser graphs, Hamiltonicity of token graphs of fan graphs, Neighbour-transitive codes in Johnson graphs, On the classification of binary completely transitive codes with almost-simple top-group
Uses Software
Cites Work
- Completely regular designs of strength one
- A design and a code invariant under the simple group \(Co_ 3\)
- Cycle-balance conditions for distance-regular graphs
- Neighbour-transitive codes in Johnson graphs
- On the simple group of D.G. Higman and C.C. Sims
- The maximal factorizations of the finite simple groups and their automorphism groups
- Bounds for binary codes of length less than 25
- Completely regular designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item