Neighbour-transitive codes in Johnson graphs

DOI10.1007/s10623-014-9982-0zbMath1296.05089arXiv1311.0113OpenAlexW2130597889WikidataQ56987453 ScholiaQ56987453MaRDI QIDQ2510649

Cheryl E. Praeger, Robert A. Liebler

Publication date: 1 August 2014

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

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

zbMATH Keywords

Johnson graphneighbour-transitivecodes in graphs2-transitive permutation group

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other types of codes (94B60) Symmetric groups (20B30)

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 ⋮ On sets with few intersection numbers in finite projective and affine spaces ⋮ Sporadic neighbour-transitive codes in Johnson graphs ⋮ Hamiltonicity of token graphs of fan 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
• On sets with few intersection numbers in finite projective and affine spaces
• On non-antipodal binary completely regular codes
• The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
• Completely regular codes
• Completely regular designs of strength one
• Cycle-balance conditions for distance-regular graphs
• Sporadic neighbour-transitive codes in Johnson graphs
• Unitary block designs
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• On completely regular binary codes and t-designs∗
• Completely regular designs
• On a class of doubly transitive groups