ON THE MINIMUM DISTANCE OF A CYCLIC CODE.

被引：0
|
作者：
Roos, C.
机构：
来源：
Delft progress report | 1981年 / 6卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper it is shown that both the BCH bound and the Hartmann-Tzeng bound for the minimum distance of a cyclic code can be obtained quite easily as consequences of an elementary result on its defining set of zeros.
引用
收藏
页码：165 / 169
相关论文
共 50 条
  • [41] Dissecting the genetic code.
    Schimmel, P
    BIOCHEMISTRY, 2002, 41 (28) : 8983 - 8983
  • [42] LINKAGE PATH CODE.
    Yan, Hong-Sen
    Hwang, Wen-Miin
    Mechanism & Machine Theory, 1984, 19 (4-5): : 425 - 429
  • [43] Parallelization of an electronic structure code.
    Schmidt, MW
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 228 : U305 - U305
  • [44] On Cyclic Codes of Composite Length and the Minimum Distance
    Xiong, Maosheng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6305 - 6314
  • [45] On a sequence of cyclic codes with minimum distance six
    Danev, D
    Olsson, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 673 - 680
  • [46] ON MINIMUM DISTANCE OF CERTAIN REVERSIBLE CYCLIC CODES
    TZENG, KK
    HARTMANN, CR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (05) : 644 - +
  • [47] On a sequence of cyclic codes with minimum distance six
    Danev, D
    Olsson, J
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 198 - 198
  • [48] Retina Stroke Code. A reality
    Ruiz-Bilbao, Susana
    Bustamante, Alejandro
    MEDICINA CLINICA, 2024, 163 (09): : 458 - 460
  • [49] IMPROVING THE UNDERSTANDABILITY OF FORTH CODE.
    Bowling, John
    The Journal of Forth application and research, 1985, 3 (02):
  • [50] Commercial Code. Large Commentary
    Schmolke, Klaus Ulrich
    RABELS ZEITSCHRIFT FUR AUSLANDISCHES UND INTERNATIONALES PRIVATRECHT, 2019, 83 (02): : 451 - 457
12345