Near-MDS codes from maximal arcs in PG(2, q)

被引:2
作者
Xu, Li
Fan, Cuiling
Han, Dongchun
机构
基金
中国国家自然科学基金;
关键词
MDS codes; NMDS codes; Locally recoverable codes; Hyperoval; oval; NMDS CODES;
D O I
10.1016/j.ffa.2023.102338
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The singleton defect of an [n, k, d] linear code C is defined as s(C) = n - k + 1 - d. Codes with S(C) = 0 are called maximum distance separable (MDS) codes, and codes with S(C) = S(C perpendicular to) = 1 are called near maximum distance separable (NMDS) codes. Both MDS codes and NMDS codes have good representations in finite projective geometry. MDS codes over Fq with length n and n-arcs in PG(k - 1, q) are equivalent objects. When k = 3, NMDS codes of length n are equivalent to (n, 3)-arcs in PG(2, q). In this paper, we deal with the NMDS codes with dimension 3. By adding some suitable projective points in maximal arcs of PG(2, q), we can obtain two classes of (q + 5, 3)-arcs (or equivalently [q + 5, 3, q + 2] NMDS codes) for any prime power q. We also determine the exact weight distribution and the locality of such NMDS codes and their duals. It turns out that the resultant NMDS codes and their duals are both distance -optimal and dimension-optimal locally recoverable codes.(c) 2023 Elsevier Inc. All rights reserved.
引用
收藏
页数:19
相关论文
共 32 条
[1]   Near-MDS codes arising from algebraic curves [J].
Abatangelo, V ;
Larato, B .
DISCRETE MATHEMATICS, 2005, 301 (01) :5-19
[2]   Near-MDS codes from elliptic curves [J].
Aguglia, Angela ;
Giuzzi, Luca ;
Sonnino, Angelo .
DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (05) :965-972
[3]   Multiple blocking sets and arcs in finite planes [J].
Ball, S .
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1996, 54 :581-593
[4]  
Ball S., 2015, Finite Geometry and Combinatorial Applications
[5]   On sets of vectors of a finite vector space in which every subset of basis size is a basis II [J].
Ball, Simeon ;
De Beule, Jan .
DESIGNS CODES AND CRYPTOGRAPHY, 2012, 65 (1-2) :5-14
[6]   On sets of vectors of a finite vector space in which every subset of basis size is a basis [J].
Ball, Simeon .
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2012, 14 (03) :733-748
[7]  
Bartoli D, 2014, DESIGN CODE CRYPTOGR, V72, P129, DOI 10.1007/s10623-013-9837-0
[8]  
Cadambe V, 2013, INT SYMP NETW COD
[9]   Infinite Families of Near MDS Codes Holding t-Designs [J].
Ding, Cunsheng ;
Tang, Chunming .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) :5419-5428
[10]  
Dodunekov S., 1994, J. Geom., V54, P30