2-neighbour-transitive codes with small blocks of imprimitivity
From MaRDI portal
Publication:2294111
DOI10.37236/8040zbMath1475.94190arXiv1806.10514OpenAlexW3004650230MaRDI QIDQ2294111
Cheryl E. Praeger, Neil I. Gillespie, Daniel R. Hawtin
Publication date: 10 February 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.10514
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Group actions on combinatorial structures (05E18)
Related Items (3)
Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ \(s\)-elusive codes in Hamming graphs ⋮ On the classification of binary completely transitive codes with almost-simple top-group
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entry-faithful 2-neighbour transitive codes
- Conway groupoids and completely transitive codes
- Completely regular codes and completely transitive codes
- Completely transitive codes in Hamming graphs
- Neighbour transitivity on codes in Hamming graphs
- Uniqueness of certain completely regular Hadamard 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
- Automorphism groups of designs
- The Affine Permutation Groups of Rank Three
- Bounds for binary codes of length less than 25
- Combinatorial Designs
- On the nonexistence of completely transitive codes
- Alphabet-almost-simple 2-neighbour-transitive codes
- A Combinatorial Problem
- New characterisations of the Nordstrom–Robinson codes
- Reed–Muller Codes Achieve Capacity on Erasure Channels
- On the Nonexistence of Perfect Codes over Finite Fields
- On completely regular codes
This page was built for publication: 2-neighbour-transitive codes with small blocks of imprimitivity
