Abstract
A code C in a generalised quadrangle \({\mathcal {Q}}\) is defined to be a subset of the vertex set of the point-line incidence graph \({\Gamma }\) of \({\mathcal {Q}}\). The minimum distance \(\delta \) of C is the smallest distance between a pair of distinct elements of C. The graph metric gives rise to the distance partition \(\{C,C_1,\ldots ,C_\rho \}\), where \(\rho \) is the maximum distance between any vertex of \({\Gamma }\) and its nearest element of C. Since the diameter of \({\Gamma }\) is 4, both \(\rho \) and \(\delta \) are at most 4. If \(\delta =4\) then C is a partial ovoid or partial spread of \({\mathcal {Q}}\), and if, additionally, \(\rho =2\) then C is an ovoid or a spread. A code C in \({\mathcal {Q}}\) is neighbour-transitive if its automorphism group acts transitively on each of the sets C and \(C_1\). Our main results (i) classify all neighbour-transitive codes admitting an insoluble group of automorphisms in thick classical generalised quadrangles that correspond to ovoids or spreads, and (ii) give two infinite families and six sporadic examples of neighbour-transitive codes with minimum distance \(\delta =4\) in the classical generalised quadrangle \({\mathsf {W}}_3(q)\) that are not ovoids or spreads.
Similar content being viewed by others
References
Bailey R.F., Hawtin D.R.: On the classification of binary completely transitive codes with almost-simple top-group. arXiv:2012.08436 (2020).
Bamberg J., Betten A., Cara P., De Beule J., Lavrauw M., Neunhöffer M.: FinInG—Finite Incidence Geometry, Version 1.4.1 (2018).
Bamberg J., Penttila T.: A classification of transitive ovoids, spreads, and m-systems of polar spaces. Forum Math. 21(2), 181–216 (2009).
Biggs N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15(3), 289–296 (1973).
Borges J., Rifà J., Zinoviev V.A.: Nonexistence of completely transitive codes with error-correcting capability \(e> 3\). IEEE Trans. Inf. Theory 47(4), 1619–1621 (2001).
Borges J., Rifà J., Zinoviev V.A.: On \(q\)-ary linear completely regular codes with \(\rho = 2\) and antipodal dual. Adv. Math. Commun. 4(4), 567–578 (2010).
Borges J., Rifà J., Zinoviev V.A.: Families of completely transitive codes and distance transitive graphs. Discret Math. 324, 68–71 (2014).
Borges J., Rifà J., Zinoviev V.A.: On completely regular codes. Probl. Inf. Transm. 55(1), 1–45 (2019).
Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symbol. Comput 24(3), 235–265 (1997).
Cimráková M., De Winter S., Fack V., Storme L.: On the smallest maximal partial ovoids and spreads of the generalized quadrangles \({W} (q)\) and \({Q} (4, q)\). Eur. J. Comb. 28(7), 1934–1942 (2007).
Coolsaet K., De Beule J., Siciliano A.: The known maximal partial ovoids of size \(q^2-1\) of \({Q}(4, q)\). J. Comb. Des. 21(3), 89–100 (2013).
De Beule J.: On large maximal partial ovoids of the parabolic quadric \({Q}(4, q)\). Des. Codes Cryptogr. 68(1), 3–10 (2013).
De Winter S., Thas K.: Partial ovoids and spreads in generalized quadrangles, and related combinatorial structures. (2005)
Delsarte P.: An Algebraic Approach to the Association Schemes of Coding Theory. Philips research reports: supplements. N. V. Philips’ Gloeilampenfabrieken (1973).
Durante N.: On sets with few intersection numbers in finite projective and affine spaces. Electron. J. Comb., 4–13 (2014).
Gillespie N.I.: Neighbour transitivity on codes in Hamming graphs. PhD thesis, The University of Western Australia, Perth (2011).
Gillespie N.I., Giudici M., Hawtin D.R., Praeger C.E.: Entry-faithful 2-neighbour transitive codes. Des. Codes Cryptogr. 79(3), 549–564 (2016).
Gillespie N.I., Hawtin D.R.: Alphabet-almost-simple \(2\)-neighbour-transitive codes. ARS Math. Contemp. 14(2), 345–357 (2017).
Gillespie N.I., Hawtin D.R., Praeger C.E.: \(2\)-Neighbour-transitive codes with small blocks of imprimitivity. Electron. J. Comb. 27(1), 1–16 (2020).
Gillespie N.I., Praeger C.E.: Neighbour transitivity on codes in Hamming graphs. Des. Codes Cryptogr. 67(3), 385–393 (2013).
Gillespie N.I., Praeger C.E.: Characterisation of a family of neighbour transitive codes. arXiv:1405.5427 (2014).
Gillespie N.I., Praeger C.E.: Diagonally neighbour transitive codes and frequency permutation arrays. J. Algebr. Comb. 39(3), 733–747 (2014).
Giudici M., Praeger C.E.: Completely transitive codes in Hamming graphs. Eur. J. Comb. 20(7), 647–662 (1999).
Hawtin, D.R.: Algebraic symmetry of codes in Hamming graphs. PhD thesis, The University of Western Australia (2017).
Hawtin, D.R., Praeger, C.E.: Minimal binary \(2\)-neighbour-transitive codes. J. Comb. Theory Ser. A, 171 (2020).
Ioppolo, M.: Codes in Johnson graphs associated with quadratic forms over \(F_2\). PhD thesis, The University of Western Australia, Perth, Australia (2019).
Liebler R.A., Praeger C.E.: Neighbour-transitive codes in Johnson graphs. Des. Codes Cryptogr. 73(1), 1–25 (2014).
Neunhöffer M., Praeger C.E.: Sporadic neighbour-transitive codes in Johnson graphs. Des. Codes Cryptogr. 72(1), 141–152 (2014).
Payne S.E., Thas J.A.: Finite Generalized Quadrangles. European Mathematical Society, Zurich (2009).
Payne S.E., Thas J.A.: An essay on self-dual generalized quadrangles. Des. Codes Cryptogr. 64(1), 93–103 (2012).
Penttila T., Williams B.: Ovoids of parabolic spaces. Geom. Dedicata 82(1), 1–19 (2000).
Semakov N.V., Zinoviev V.A., Zaitsev G.V.: Uniformly packed codes. Probl. Inf. Transm. 7(1), 30–39 (1971).
Suzuki M.: Group Theory I. Grundlehren der Mathematischen Wissenschaften. Springer, Berlin (1982).
Tallini G.: Blocking sets with respect to planes in \({P}{G} (3, q)\) and maximal spreads of a non-singular quadric in \({P}{G} (4, q)\). Mitt. Math. Sem. Giessen 201, 141–147 (1991).
The GAP Group. GAP—Groups, Algorithms, and Programming, Version 4.11.1 (2021).
Thas K.: Symmetry in Finite Generalized Quadrangles. Springer, Berlin (2004).
Wilson R.: The Finite Simple Groups, vol. 251. Graduate Texts in Mathematics. Springer, New York (2009).
Acknowledgements
We sincerely thank Sam Mattheus for bringing to our attention the argument in Remark 3.3, and the anonymous referees for their helpful comments.
Funding
This work has been supported by the Croatian Science Foundation under the projects 6732 and 5713.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare there are no conflicts of interest.
Additional information
Communicated by C. E. Praeger.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Crnković, D., Hawtin, D.R. & Švob, A. Neighbour-transitive codes and partial spreads in generalised quadrangles. Des. Codes Cryptogr. 90, 1521–1533 (2022). https://doi.org/10.1007/s10623-022-01053-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01053-z