Neighbour-transitive codes and partial spreads in generalised quadrangles

DOI10.1007/s10623-022-01053-zzbMath1495.94142arXiv2105.05833WikidataQ114849737 ScholiaQ114849737MaRDI QIDQ2672306

Dean Crnković, Daniel R. Hawtin, Andrea Švob

Publication date: 8 June 2022

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

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

zbMATH Keywords

partial spread; partial ovoid; generalised quadrangle; neighbour-transitive code

Mathematics Subject Classification ID

51E12: Generalized quadrangles and generalized polygons in finite geometry

94B25: Combinatorial codes

05E18: Group actions on combinatorial structures

Related Items

Neighbour-transitive codes in Kneser graphs

Uses Software

• GAP
• Magma
• FinInG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entry-faithful 2-neighbour transitive codes
• An essay on self-dual generalized quadrangles
• Bounds on partial ovoids and spreads in classical generalized quadrangles
• 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
• Finite generalized quadrangles
• The Magma algebra system. I: The user language
• Ovoids of parabolic spaces
• Completely transitive codes in Hamming graphs
• Neighbour transitivity on codes in Hamming graphs
• On large maximal partial ovoids of the parabolic quadric \(Q(4,q)\)
• Sporadic neighbour-transitive codes in Johnson graphs
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Minimal binary 2-neighbour-transitive codes
• Families of completely transitive codes and distance transitive graphs
• Diagonally neighbour transitive codes and frequency permutation arrays
• Neighbour-transitive codes in Johnson graphs
• Perfect codes in graphs
• On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\)
• A classification of transitive ovoids, spreads, and m-systems of polar spaces
• The Finite Simple Groups
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Alphabet-almost-simple 2-neighbour-transitive codes
• The Known Maximal Partial Ovoids of Size of
• On completely regular codes