A heuristic algorithm for the construction of good linear codes

被引：10
|
作者：
Zwanzger, Johannes [1 ]
机构：
[1] Univ Bayreuth, Dept Math, D-95440 Bayreuth, Germany
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 05期
关键词：
coding theory; extension; heuristic algorithm; high minimum distance; linear codes; weight distribution;
D O I：
10.1109/TIT.2008.920323
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this correspondence, we describe a heuristic method for the construction of linear codes with given parameters n, k, q, and a prescribed minimum distance of at least d. Our approach is based on a function estimating the probability that a code of dimension k and blocklength n' < n over G F (q) is extendable to a code with the given properties. Combining this evaluation function with a search algorithm, we were able to improve 40 entries in the international tables for the best known minimum distance in the cases q = 2 5 71 9 and found at least two new optimal linear codes.
引用
收藏
页码：2388 / 2392
页数：5
相关论文
共 50 条
  • [41] Construction of a class of linear codes with two weights
    Lv, Hongxia
    Du, Xiaoni
    Li, Xiaodan
    2018 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS (NANA), 2018, : 362 - 365
  • [42] A LINEAR CONSTRUCTION FOR CERTAIN KERDOCK AND PREPARATA CODES
    CALDERBANK, AR
    HAMMONS, AR
    KUMAR, PV
    SLOANE, NJA
    SOLE, P
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1993, 29 (02) : 218 - 222
  • [43] A concatenated construction of linear complementary pair of codes
    Guneri, Cem
    Ozbudak, Ferruh
    Sacikara, Elif
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (05): : 1103 - 1114
  • [44] Construction of linear codes with large minimum distance
    Braun, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1687 - 1691
  • [45] A construction of linear codes and their complete weight enumerators
    Yang, Shudi
    Kong, Xiangli
    Tang, Chunming
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 48 : 196 - 226
  • [46] A concatenated construction of linear complementary pair of codes
    Cem Güneri
    Ferruh Özbudak
    Elif Saçıkara
    Cryptography and Communications, 2019, 11 : 1103 - 1114
  • [47] New good codes via CQUEST - A system for the silicon search of linear codes
    Rehfinger, T
    Babu, NS
    Zimmermann, KH
    ALGEBRAIC COMBINATORICS AND APPLICATIONS, 2001, : 294 - 306
  • [48] A construction of q-ary linear codes with irreducible cyclic codes
    Ziling Heng
    Cunsheng Ding
    Designs, Codes and Cryptography, 2019, 87 : 1087 - 1108
  • [49] COMBINATORIAL CONSTRUCTION OF LINEAR QUANTUM CODES FROM QUATERNARY BCH CODES
    Li, Ruihu
    Xu, Zongben
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2009, 7 (05) : 1039 - 1046
  • [50] A construction of q-ary linear codes with irreducible cyclic codes
    Heng, Ziling
    Ding, Cunsheng
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (05) : 1087 - 1108
12345