Three new classes of optimal quinary cyclic codes with minimum distance four

被引:1
|
作者
Liu, Yan [1 ]
Cao, Xiwang [2 ,3 ]
机构
[1] Yancheng Inst Technol, Coll Math & Phys, Yancheng 224003, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Sch Math Sci, Nanjing 210016, Peoples R China
[3] MIIT, Key Lab Math Modeling & High Performance Comp Air, Nanjing 210016, Peoples R China
基金
中国国家自然科学基金;
关键词
Cyclic code; Optimal code; Quinary code; Minimum distance;
D O I
10.1007/s00200-023-00621-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Due to their wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an important subject of study for many years. Recently, several classes of optimal quinary cyclic codes of the forms C(0,1,e) and C(1,e,s) are presented in the literature, where s = 5(m)-1/(2) and 2 = e = 5(m) - 2. In this paper, by considering the solutions of certain equations over finite fields, we give three new classes of infinite families of optimal quinary cyclic codes of the form C(1,e,s) with parameters [5m - 1, 5(m) - 2(m) - 2, 4] . Specifically, we make progress towards an open problem proposed by Gaofei Wu et al. [17].
引用
收藏
页数:9
相关论文
共 50 条
  • [41] Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
    Zeh, Alexander
    Wachter-Zeh, Antonia
    Gadouleau, Maximilien
    Bezzateev, Sergey
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 126 - +
  • [42] Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
    Heng, Ziling
    Yue, Qin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (08) : 4501 - 4513
  • [43] Four classes of new entanglement-assisted quantum optimal codes
    Chen, Xiaojing
    Zhu, Shixin
    Jiang, Wan
    Pang, Binbin
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2021, 67 (1-2) : 937 - 952
  • [44] Four classes of new entanglement-assisted quantum optimal codes
    Xiaojing Chen
    Shixin Zhu
    Wan Jiang
    Binbin Pang
    Journal of Applied Mathematics and Computing, 2021, 67 : 937 - 952
  • [45] On the Optimal Minimum Distance of Fractional Repetition Codes
    Zhu, Bing
    Shum, Kenneth W.
    Wang, Weiping
    Wang, Jianxin
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [46] Two new bounds on the size of binary codes with a minimum distance of three
    Klein, Yaron
    Litsyn, Simon
    Vardy, Alexander
    Designs, Codes, and Cryptography, 1995, 6 (03):
  • [47] A NEW PROCEDURE FOR DECODING CYCLIC AND BCH CODES UP TO ACTUAL MINIMUM DISTANCE
    FENG, GL
    TZENG, KK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1364 - 1374
  • [48] Construction of ternary constant-composition codes with weight three and minimum distance four
    Svanström, M
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 143 - 143
  • [49] A new class of distance-optimal binary cyclic codes and their duals
    Liu, Kaiqiang
    Ren, Wenli
    Wang, Feng
    Wang, Jianpeng
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2023, 34 (01) : 99 - 109
  • [50] A new class of distance-optimal binary cyclic codes and their duals
    Kaiqiang Liu
    Wenli Ren
    Feng Wang
    Jianpeng Wang
    Applicable Algebra in Engineering, Communication and Computing, 2023, 34 : 99 - 109