New One-Generator Quasi-cyclic Codes over GF(7)

被引：5
作者：
R. Daskalov
P. Hristov
机构：
来源：
Problems of Information Transmission | 2002年 / 38卷 / 1期
关键词：
Lower Bound; System Theory; Minimum Distance; Linear Code;
D O I：
10.1023/A:1020094206873
中图分类号：
学科分类号：
摘要：
Let [n,k,d]q codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this paper, seventeen new codes are constructed, which improve the known lower bounds on minimum distance.
引用
收藏
页码：50 / 54
页数：4
相关论文
共 33 条
  • [31] A Random Local Matroid Search Algorithm to Construct Good Rate 1/p Systematic Binary Quasi-Cyclic Codes
    Wu, Guangfu
    Li, Yong
    Zhang, Shuiping
    He, Jiguang
    IEEE COMMUNICATIONS LETTERS, 2015, 19 (05) : 699 - 702
  • [32] On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
    Aydin, Nuh
    Lambrinos, Jonathan
    VandenBerg, Oliver
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (10) : 2199 - 2212
  • [33] MINIMAL CYCLIC CODES OF LENGTH 16pn, OVER GF(q) WHERE q IS PRIME POWER OF THE FORM 16k
    Singh, Vishvajit
    Pruthi, Manju
    Singh, Jagbir
    ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 2019, 19 (02): : 97 - 127
1234