On the classification of binary completely transitive codes with almost-simple top-group
From MaRDI portal
Publication:2080231
DOI10.1016/j.ejc.2022.103604zbMath1506.94099arXiv2012.08436MaRDI QIDQ2080231
Daniel R. Hawtin, Robert F. Bailey
Publication date: 7 October 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.08436
Related Items
On new infinite families of completely regular and completely transitive codes, Neighbour-transitive codes in Kneser graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entry-faithful 2-neighbour transitive codes
- On sets with few intersection numbers in finite projective and affine spaces
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- Completely regular codes and completely transitive codes
- On a class of binary linear completely transitive codes with arbitrary covering radius
- Completely regular codes
- On finite affine 2-arc transitive graphs
- A design and a code invariant under the simple group \(Co_ 3\)
- Completely transitive codes in Hamming graphs
- A family of antipodal distance-regular graphs related to the classical Preparata codes
- Neighbour transitivity on codes in Hamming graphs
- Sporadic neighbour-transitive codes in Johnson graphs
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- New families of completely regular codes and their corresponding distance regular coset graphs
- Families of completely transitive codes and distance transitive graphs
- Diagonally neighbour transitive codes and frequency permutation arrays
- Neighbour-transitive codes in Johnson graphs
- \(k\)-homogeneous groups
- 2-Designs and Codes from Simple Groups L 3(q) and Higman-Sims Sporadic Simple Group HS
- On the Preparata and Goethals codes
- Bounds for binary codes of length less than 25
- Combinatorial Designs
- Nonexistence of completely transitive codes with error-correcting capability e<3
- Alphabet-almost-simple 2-neighbour-transitive codes
- A Combinatorial Problem
- New characterisations of the Nordstrom–Robinson codes
- On the Nonexistence of Perfect Codes over Finite Fields
- On completely regular codes
