Sporadic neighbour-transitive codes in Johnson graphs

DOI10.1007/S10623-013-9853-0zbMATH Open1294.05093DBLPjournals/dcc/NeunhofferP14arXiv1308.0398OpenAlexW2008146091WikidataQ56987458 ScholiaQ56987458MaRDI QIDQ2249651FDOQ2249651

Authors: Max Neunhöffer, Cheryl E. Praeger 

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree v and does not occur in an infinite family of two-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length v and number of code words. We construct an additional five neighbour-transitive codes with minimum distance two admitting such a group. All 27 codes are t-designs with t at least two.

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

Recommendations

• Neighbour-transitive codes in Johnson graphs
• Codes and designs in Johnson graphs with high symmetry
• Neighbour transitivity on codes in Hamming graphs
• Alphabet-almost-simple 2-neighbour-transitive codes
• 2-neighbour-transitive codes with small blocks of imprimitivity

zbMATH Keywords

minimum distanceJohnson grapherror correcting codeincidence transitiveneighbour-transitive

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the simple group of D.G. Higman and C.C. Sims
• Neighbour-transitive codes in Johnson graphs
• Title not available (Why is that?)
• Bounds for binary codes of length less than 25
• Title not available (Why is that?)
• The maximal factorizations of the finite simple groups and their automorphism groups
• Completely regular designs
• A design and a code invariant under the simple group \(Co_ 3\)
• Cycle-balance conditions for distance-regular graphs
• Completely regular designs of strength one
• Title not available (Why is that?)

Cited In (8)

• Hamiltonicity of token graphs of fan graphs
• A NOTE ON LINEAR CODES FROM JOHNSON GRAPHS
• Edge-transitive token graphs
• Neighbour-transitive codes in Kneser graphs
• Neighbour-transitive codes in Johnson graphs
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• Regularity and planarity of token graphs
• On the classification of binary completely transitive codes with almost-simple top-group

Uses Software

• GAP
• DESIGN
• ATLAS Group Representations
• Code Tables

This page was built for publication: Sporadic neighbour-transitive codes in Johnson graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249651)