Self-Dual Near MDS Codes from Elliptic Curves

被引:23
作者
Jin, Lingfei [1 ,2 ,3 ]
Kan, Haibin [1 ,2 ]
机构
[1] Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Sch Comp Sci, Shanghai 200433, Peoples R China
[2] Shanghai Inst Intelligent Elect & Syst, Shanghai, Peoples R China
[3] State Key Lab Cryptol, Beijing 100878, Peoples R China
基金
中国国家自然科学基金;
关键词
Near MDS codes; self-dual; elliptic curve; group structure; CLASSIFICATION;
D O I
10.1109/TIT.2018.2880913
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, self-dual MDS codes have attracted a lot of attention due to theoretical interest and practical importance. Similar to self-dual MDS codes, self-dual near MDS (NMDS for short) codes have nice structures as well. From both theoretical and practical points of view, it is natural to study self-dual NMDS codes. Although there has been lots of work on NMDS codes in literature, little is known for self-dual NMDS codes. It seems more challenging to construct self-dual NMDS codes than self-dualMDS codes. The only work on construction of self-dual NMDS codes shows existence of q-ary self-dual NMDS codes of length q - 1 for odd prime power q or length up to 16 for some small primes q with q <= 197. In this paper, we make use of properties of elliptic curves to construct self-dual NMDS codes. It turns out that, as long as 2 vertical bar q and n is even with 4 <= n <= q + left perpendicular 2 root q right perpendicular - 2, one can construct a self-dual NMDS code of length n over Fq. Furthermore, for odd prime power q, there exists a self-dual NMDS code of length n over Fq if q >= 4(n+3) x (n + 3)(2).
引用
收藏
页码:2166 / 2170
页数:5
相关论文
共 27 条
[1]   On codes, matroids, and secure multiparty computation from linear secret-sharing schemes [J].
Cramer, Ronald ;
Daza, Vanesa ;
Gracia, Ignacio ;
Urroz, Jorge Jimenez ;
Leander, Gregor ;
Marti-Farre, Jaume ;
Padro, Carles .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2644-2657
[2]  
Dau SH, 2013, IEEE INT SYMP INFO, P1889, DOI 10.1109/ISIT.2013.6620554
[3]  
Dodunekov S., 1994, J GEOMETRY, V54, P30
[4]   Near-MDS codes over some small fields [J].
Dodunekov, SM ;
Landjev, IN .
DISCRETE MATHEMATICS, 2000, 213 (1-3) :55-65
[5]   Almost-MDS and near-MDS codes for error detection [J].
Dodunekova, R ;
Dodunekov, SM ;
Klove, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (01) :285-290
[6]   Secret-sharing schemes based on self-dual codes [J].
Dougherty, Steven T. ;
Mesnager, Sihem ;
Sole, Patrick .
2008 IEEE INFORMATION THEORY WORKSHOP, 2008, :338-+
[7]   MDS self-dual codes over large prime fields [J].
Georgiou, S ;
Koukouvinos, C .
FINITE FIELDS AND THEIR APPLICATIONS, 2002, 8 (04) :455-470
[8]   On Self-Dual MDS Codes [J].
Grassl, Markus ;
Gulliver, T. Aaron .
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, :1954-+
[9]   New MDS self-dual codes over finite fields [J].
Guenda, Kenza .
DESIGNS CODES AND CRYPTOGRAPHY, 2012, 62 (01) :31-42
[10]   New MDS or near-MDS self-dual codes [J].
Gulliver, T. Aaron ;
Kim, Jon-Lark ;
Lee, Yoonjin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) :4354-4360