Optimal Few-Weight Codes From Simplicial Complexes

被引:33
作者
Wu, Yansheng [1 ,2 ,3 ]
Zhu, Xiaomeng [1 ,2 ]
Yue, Qin [1 ,2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 211100, Peoples R China
[2] State Key Lab Cryptol, Beijing 100878, Peoples R China
[3] Ewha Womans Univ, Dept Math, Seoul 03760, South Korea
基金
中国国家自然科学基金;
关键词
Few-weight codes; codes over rings; simplicial complexes; Griesmer bound; LINEAR CODES; TRACE CODES; 2-WEIGHT;
D O I
10.1109/TIT.2019.2946840
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, some infinite families of binary minimal and optimal linear codes were constructed from simplicial complexes by Hyun et al. Inspired by their work, we present two new constructions of codes over the ring F-2 + uF(2) by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over F-2 + uF(2). Our results show that the codes have few Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of binary distance optimal codes.
引用
收藏
页码:3657 / 3663
页数:7
相关论文
共 24 条
[1]   How to Build Robust Shared Control Systems [J].
Anderson R. ;
Ding C. ;
Helleseth T. ;
Kløve T. .
Designs, Codes and Cryptography, 1998, 15 (2) :111-124
[2]   Linear codes from perfect nonlinear mappings and their secret sharing schemes [J].
Carlet, C ;
Ding, CS ;
Yuan, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2089-2102
[3]  
Cary Huffman., 2003, Fundamentals of Error-Correcting Codes
[4]   Linear codes from simplicial complexes [J].
Chang, Seunghwan ;
Hyun, Jong Yoon .
DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (10) :2167-2181
[5]   Cyclotomic linear codes of order 3 [J].
Ding, Cunsheng ;
Niederreiter, Harald .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) :2274-2277
[6]   A generic construction of Cartesian authentication codes [J].
Ding, Cunsheng ;
Helleseth, Tor ;
Klove, Torleiv ;
Wang, Xuesong .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) :2229-2235
[7]   Linear Codes From Some 2-Designs [J].
Ding, Cunsheng .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) :3265-3275
[8]  
Grassl M., Bounds on the minimum distance of linear codes and quantum codes
[9]   A BOUND FOR ERROR-CORRECTING CODES [J].
GRIESMER, JH .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (05) :532-542
[10]   Two classes of two-weight linear codes [J].
Heng, Ziling ;
Yue, Qin .
FINITE FIELDS AND THEIR APPLICATIONS, 2016, 38 :72-92