Construction of MDS Codes With Complementary Duals

被引：87
|
作者：
Jin, Lingfei [1 ,2 ]
机构：
[1] Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Sch Comp Sci, Shanghai 200433, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2017年 / 63卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Generalized Reed-Solomon codes; MDS codes; Linear complementary dual; LINEAR CODES;
D O I：
10.1109/TIT.2016.2644660
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A linear complementary dual (LCD) code is a linear code with complimentary dual. LCD codes have been extensively studied in literature. On the other hand, maximum distance separable (MDS) codes are an important class of linear codes that have found wide applications in both theory and practice. However, little is known about MDS codes with complimentary duals. The main purpose of this paper is to construct several classes of MDS codes with complimentary duals, i.e., LCD MDS codes, through generalized Reed-Solomon codes.
引用
收藏
页码：2843 / 2847
页数：5
相关论文
共 50 条
  • [31] A Construction of New MDS Symbol-Pair Codes
    Kai, Xiaoshan
    Zhu, Shixin
    Li, Ping
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) : 5828 - 5834
  • [32] A Different Construction for Some Classes of Quantum MDS Codes
    Sari, Mustafa
    Kolotoglu, Emre
    MATHEMATICS IN COMPUTER SCIENCE, 2020, 14 (01) : 35 - 44
  • [33] A Different Construction for Some Classes of Quantum MDS Codes
    Mustafa Sarı
    Emre Kolotoğlu
    Mathematics in Computer Science, 2020, 14 : 35 - 44
  • [34] Construction of quantum MDS codes from generalized Reed-Solomon codes
    Lu, Mingwei
    Zhu, Shixin
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2023, 21 (05)
  • [35] Construction of long MDS self-dual codes from short codes
    Xie, Derong
    Fang, Xiaolei
    Luo, Jinquan
    FINITE FIELDS AND THEIR APPLICATIONS, 2021, 72
  • [36] A New Construction of Z-complementary Codes
    Feng, Lifang
    Zhou, Xianwei
    Li, Xinyu
    2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012), 2012, : 574 - 577
  • [37] A concatenated construction of linear complementary pair of codes
    Guneri, Cem
    Ozbudak, Ferruh
    Sacikara, Elif
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (05): : 1103 - 1114
  • [38] A concatenated construction of linear complementary pair of codes
    Cem Güneri
    Ferruh Özbudak
    Elif Saçıkara
    Cryptography and Communications, 2019, 11 : 1103 - 1114
  • [39] Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
    Jin, Lingfei
    Xing, Chaoping
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6277 - 6282
  • [40] Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
    Leemans, Dimitri
    Rodrigues, Bernardo G.
    MATHEMATICAL COMMUNICATIONS, 2016, 21 (02) : 239 - 249
12345