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

被引:3
作者
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].
引用
收藏
页码:493 / 501
页数:9
相关论文
共 50 条
  • [41] Generation of matrices for determining minimum distance and decoding of cyclic codes
    Shen, KK
    Wang, C
    Tzeng, KK
    Shen, BZ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 653 - 657
  • [42] Relations between several minimum distance bounds of binary cyclic codes
    Matsuo, T
    Araki, Y
    Imamura, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (11) : 2253 - 2255
  • [43] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
  • [44] Explicit Cyclic and Quasi-Cyclic Codes With Optimal, Best Known Parameters, and Large Relative Minimum Distances
    Xie, Conghui
    Chen, Hao
    Yuan, Chen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (12) : 8688 - 8697
  • [45] Some new results on dimension and Bose distance for various classes of BCH codes
    Cherchem, Ahmed
    Jamous, Abdelillah
    Liu, Hongwei
    Maouche, Youcef
    FINITE FIELDS AND THEIR APPLICATIONS, 2020, 65
  • [46] New distance bounds for quasi-cyclic codes
    Ozbudak, Ferruh
    Ozkaya, Buket
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (12) : 3981 - 4009
  • [47] On Some Algorithms on the Proposed Lower Bound of the Designed Minimum Distance for Cyclic Codes
    Kaida, Takayasu
    Zheng, Junru
    2013 19TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC): SMART COMMUNICATIONS TO ENHANCE THE QUALITY OF LIFE, 2013, : 520 - 524
  • [48] CYCLIC AND BCH CODES WHOSE MINIMUM DISTANCE EQUALS THEIR MAXIMUM BCH BOUND
    Joaquin Bernal, Jose
    Bueno-Carreno, Diana H.
    Jacobo Simon, Juan
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (02) : 459 - 474
  • [49] The completion of optimal cyclic quaternary codes of weight 3 and distance 3
    Liantao Lan
    Yanxun Chang
    Lidong Wang
    Designs, Codes and Cryptography, 2022, 90 : 851 - 862
  • [50] The completion of optimal cyclic quaternary codes of weight 3 and distance 3
    Lan, Liantao
    Chang, Yanxun
    Wang, Lidong
    DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (04) : 851 - 862