On the Construction of Binary Optimal LCD Codes with Short Length

被引:16
作者
Fu, Qiang [1 ]
Li, Ruihu [1 ]
Fu, Fangwei [2 ]
Rao, Yi [1 ]
机构
[1] Air Force Engn Univ, Sci Coll, Xian 710051, Shaanxi, Peoples R China
[2] Nankai Univ, Chern Inst Math, Tianjin, Peoples R China
基金
中国国家自然科学基金;
关键词
Linear complementary dual; binary optimal code; minimum distance; LINEAR CODES;
D O I
10.1142/S0129054119500242
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A q-ary linear code C is called a linear complementary dual (LCD) code if it meets its dual trivially. Binary LCD codes play a significant role for their advantage of low complexity for implementations against side-channel attacks and fault injection attacks. In this paper, the problem of finding LCD codes over the binary field is discussed. Many new codes and new bounds are presented, as well as a table of optimal LCD codes (or upper and lower bounds on such codes) of length up to 30 bits.
引用
收藏
页码:1237 / 1245
页数:9
相关论文
共 16 条
[1]  
Alahmadi A., ARXIV151108889V1
[2]   On the binary projective codes with dimension 6 [J].
Bouyukliev, Iliya .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (12) :1693-1708
[3]   Complementary Dual Codes for Counter-Measures to Side-Channel Attacks [J].
Carlet, Claude ;
Guilley, Sylvain .
CODING THEORY AND APPLICATIONS, 4TH INTERNATIONAL CASTLE MEETING, 2015, 3 :97-105
[4]  
Cary Huffman., 2003, Fundamentals of Error-Correcting Codes
[5]  
Dougherty S., ARXIV150601955V1
[6]  
Fu Q., 2017, 2 INT C COMP SCI TEC, P129
[7]   Some bounds on binary LCD codes [J].
Galvez, Lucky ;
Kim, Jon-Lark ;
Lee, Nari ;
Roe, Young Gun ;
Won, Byung-Sun .
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2018, 10 (04) :719-728
[8]  
Grassl M., BOUNDS MINIMUM DISTA
[9]   DESIGN METHODS FOR MAXIMUM MINIMUM-DISTANCE ERROR-CORRECTING CODES [J].
MACDONALD, JE .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (01) :43-57
[10]   LINEAR CODES WITH COMPLEMENTARY DUALS [J].
MASSEY, JL .
DISCRETE MATHEMATICS, 1992, 106 :337-342