Projective systems and bounds on the length of codes of non-zero defect
DOI:
https://doi.org/10.13069/jacodesmath.v14i1.385Keywords:
Projective system, Linear codes, Singleton defects, Near-MDS codes, Almost-MDS codesAbstract
We derive bounds on the lengths of linear codes with fixed Singleton defect, working within the framework of projective systems. This geometric perspective allows us to unify and extend a range of existing results. We study the maximum length of a non-degenerate linear code when its dimension, field order, and Singleton defect are fixed, and refine this question by also prescribing the defect of the dual code. We further investigate the maximum dimension in which a code can attain the general length bound. Among our main results, we provide sufficient conditions under which a code and its dual have equal Singleton defect, addressing a gap in the existing literature. We show that codes of sufficient length must be projective, meet the Griesmer bound, and have an almost maximum distance separable dual. Our bounds subsume or improve several results in the literature. For field orders greater than three, we propose two conjectures on length-maximal codes of dimension at least five, supported by computational evidence.
Received: 05 May 2025 | Revised: 24 June 2026 | Accepted: 26 June 2026
Downloads
References
S. Ball, Multiple blocking sets and arcs in finite planes, J. London Math. Soc. (2) 54(3) (1996) 581–593.
S. Ball, On sets of vectors of a finite vector space in which every subset of basis size is a basis, J. Eur. Math. Soc. 14(3) (2012) 733–748.
S. Ball, Finite Geometry and Combinatorial Applications, vol. 82 in London Mathematical Society Student Texts, Cambridge University Press, Cambridge (2015).
S. Ball, A. Blokhuis, and F. Mazzocca, Maximal arcs in Desarguesian planes of odd order do not exist, Combinatorica 17(1) (1997) 31–41.
S. Ball and J. De Beule, On sets of vectors of a finite vector space in which every subset of basis size is a basis II, Des. Codes Cryptogr. 65(1-2) (2012) 5–14.
S. Ball and J. W. P. Hirschfeld, Bounds on $(n,r)$-arcs and their application to linear codes, Finite Fields Appl. 11(3) (2005) 326–336.
S. Ball and M. Lavrauw, Arcs in finite projective spaces, EMS Surv. Math. Sci. 6(1-2) (2019) 133–172.
A. Barlotti, Sui ${k;n}$-archi di un piano lineare finito, Boll. Un. Mat. Ital. (3) 11(4) (1956) 553–556.
A. Blokhuis, On multiple nuclei and a conjecture of Lunelli and Sce, Bull. Belg. Math. Soc. Simon Stevin 1(3) (1994) 349–353.
M. A. de Boer, Almost MDS codes, Des. Codes Cryptogr. 9 (1996) 143–155.
R. C. Bose, Mathematical theory of the symmetrical factorial design, Sankhy\=a 8 (1947) 107–166.
A. A. Bruen and R. Silverman, On the nonexistence of certain M.D.S. codes and projective planes, Math. Z. 183 (1983) 171–175.
K. A. Bush, Orthogonal arrays of index unity, Ann. Math. Statist. 23 (1952) 426–434.
L. R. A. Casse, A solution to Beniamino Segre's ``Problem $I_{r,q}$'' for $q$\ even, Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Nat. (8) 46 (1969) 13–20.
L. R. A. Casse and D. G. Glynn, The solution to Beniamino Segre's problem $I_{r,q},$ $r=3,$ $q=2^{h}$, Geom. Dedicata 13 (1982) 157–163.
R. H. F. Denniston, Some maximal arcs in finite projective planes, J. Combinatorial Theory 6 (1969) 317–319.
S. Dodunekov and I. Landgev, On near-MDS codes, J. Geom. 54 (1995) 30–43.
S. M. Dodunekov and I. N. Landjev, Near-MDS codes over some small fields, Discrete Math. 213(1-3) (2000) 55–65.
A. Faldum and W. Willems, Codes of small defect, Des. Codes Cryptogr. 10 (1997) 341–350.
M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Online available at \url{http://www.codetables.de}, Accessed on 2026-09-12 (2007).
B. R. Gulati and E. G. Kounias, Maximal sets of points in finite projective space, no t-linearly dependent, J. Combinatorial Theory Ser. A 15 (1973) 54–65.
J. W. P. Hirschfeld, Finite Projective Spaces of Three Dimensions, Oxford Mathematical Monographs, Oxford University Press, New York (1985).
J. W. P. Hirschfeld, Projective Geometries over Finite Fields, 2nd ed., Oxford Mathematical Monographs, Oxford University Press, New York (1998).
J. W. P. Hirschfeld and L. Storme, The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001, Springer US, Boston, MA (2001) 201–246.
Q. Liao and H. Liao, On $m$-MDS codes over finite fields, Int. J. Comput. Math. 91(5) (2014) 863–871.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. I, vol. 16 in North-Holland Mathematical Library, North-Holland, Amsterdam (1977).
B. Qvist, Some remarks concerning curves of the second degree in a finite plane, Ann. Acad. Sci. Fennicae Ser. A. I. Math.-Phys. 1952(134) (1952) 27.
B. Segre, Curve razionali normali e $k$-archi negli spazi finiti, Ann. Mat. Pura Appl. 39 (1955) 357–379.
J. A. Thas, Some results concerning ${(q+1)(n-1);\,n}$-arcs and ${(q+1)$ $(n-1)+1;\,n}$-arcs in finite projective planes of order $q$, J. Combinatorial Theory Ser. A 19(2) (1975) 228–232.
The SageMath Developers, Sagemath (version 10.3) [computer software], Zenodo (2024).
H. Tong, NNMDS codes, J Syst Sci Complex. 25 (2012) 617–624.
M. Tsfasman, S. Vlăduț, and D. Nogin, Algebraic Geometric Codes: Basic Notions, American Mathematical Society (2007).
Z. Weiner, On $(k,p^e)$-arcs in Desarguesian planes, Finite Fields Appl. 10(3) (2004) 390–404.
