Minimal binary 2-neighbour-transitive codes

DOI10.1016/j.jcta.2019.105173zbMath1467.94050arXiv1807.09831OpenAlexW2983401545MaRDI QIDQ2299621

Cheryl E. Praeger, Daniel R. Hawtin

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.09831

zbMATH Keywords

Hamming graphcompletely regularbinary code2-transitivecompletely transitive2-neighbour-transitive

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Group actions on combinatorial structures (05E18)

Related Items (4)

Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ Neighbour-transitive codes in Kneser graphs ⋮ \(s\)-elusive codes in Hamming graphs ⋮ On the classification of binary completely transitive codes with almost-simple top-group

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely regular codes and completely transitive codes
• A global code invariant under the Higman-Sims group
• On finite affine 2-arc transitive graphs
• About non equivalent completely regular codes with identical intersection array
• A design and a code invariant under the simple group \(Co_ 3\)
• Completely transitive codes in Hamming graphs
• Hermitian function fields, classical unitals, and representations of 3-dimensional unitary groups.
• Neighbour transitivity on codes in Hamming graphs
• Families of completely transitive codes and distance transitive graphs
• Diagonally neighbour transitive codes and frequency permutation arrays
• Automorphism groups of designs
• A New Form of the Square Root Bound
• Bounds for binary codes of length less than 25
• The Modular Permutation Representations of the Known Doubly Transitive Groups
• Combinatorial Designs
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Alphabet-almost-simple 2-neighbour-transitive codes
• New characterisations of the Nordstrom–Robinson codes
• Reed-Muller codes achieve capacity on erasure channels
• On the Nonexistence of Perfect Codes over Finite Fields

This page was built for publication: Minimal binary 2-neighbour-transitive codes