THE APPLICATION OF LINEAR COMPLEXITY OF SEQUENCES TO LOWER BOUNDS ON THE MINIMUM DISTANCE OF CYCLIC CODES

被引：0
|
作者：
李元兴 [1 ]
粱传甲 [1 ]
机构：
[1] Xidian University Xi’an
来源：
Journal of Electronics(China) | 1990年 / 04期
关键词：
Cyclic codes; Linear complexity; Fourier transforms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexityof sequences,and new theorems about the lower bounds are obtained.
引用
收藏
页码：312 / 316
页数：5
相关论文
共 50 条
  • [1] New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes
    Qiu, Jing
    Fang, Weijun
    Fu, Fang-Wei
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 4968 - 4982
  • [2] Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
    Zeh, Alexander
    Wachter-Zeh, Antonia
    Gadouleau, Maximilien
    Bezzateev, Sergey
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 126 - +
  • [3] MINIMUM DISTANCE BOUNDS FOR CYCLIC CODES AND DELIGNES THEOREM
    MORENO, O
    KUMAR, PV
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1524 - 1534
  • [4] Upper and Lower Bounds on the Minimum Distance of Expander Codes
    Frolov, Alexey
    Zyablov, Victor
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401
  • [5] Lower bounds on the minimum average distance of binary codes
    Mounits, Beniamin
    [J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 6241 - 6253
  • [6] MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES
    HELGERT, HJ
    STINAFF, RD
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (03) : 344 - 356
  • [7] On the complexity of minimum distance decoding of long linear codes
    Barg, A
    Krouk, E
    van Tilborg, HCA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) : 1392 - 1405
  • [8] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
    Hashemi, Yoones
    Banihashemi, Amir H.
    [J]. IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
  • [9] Lower bounds on the minimum distance of long codes in the Lee metric
    Randriam, Hugues
    Sok, Lin
    Sole, Patrick
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2015, 74 (02) : 441 - 452
  • [10] Lower bounds on the minimum distance of long codes in the Lee metric
    Hugues Randriam
    Lin Sok
    Patrick Solé
    [J]. Designs, Codes and Cryptography, 2015, 74 : 441 - 452
12345