Improved bounds for quaternary linear codes of dimension 6

被引：4
|
作者：
Gulliver, TA
Ostergard, PRJ
机构：
[1] Univ Canterbury, Dept Elect & Elect Engn, Christchurch, New Zealand
[2] Helsinki Univ Technol, Dept Comp Sci, FIN-02150 Espoo, Finland
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 1998年 / 9卷 / 02期
关键词：
quasi-cyclic codes; quaternary linear codes; tabu search;
D O I：
10.1007/s002000050100
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, twenty new codes of dimension 6 are presented which give improved bounds on the maximum possible minimum distance of quaternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. A table of upper and lower bounds for d(4)(n, 6) is presented for n less than or equal to 200.
引用
收藏
页码：153 / 159
页数：7
相关论文
共 50 条
  • [41] Improved lower bounds for multicovering codes
    Klapper, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2532 - 2534
  • [42] Improved lower bounds for multicovering codes
    Klapper, A
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 51 - 51
  • [43] Improved Bounds on Binary Identifying Codes
    Exoo, Geoffrey
    Junnila, Ville
    Laihonen, Tero
    Ranto, Sanna
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 629 - +
  • [44] Upper Bounds for Linear Graph Codes
    Versteegen, Leo
    RANDOM STRUCTURES & ALGORITHMS, 2024,
  • [45] Bounds on the Covering Radius of Linear Codes
    A. Ashikhmin
    A. Barg
    Designs, Codes and Cryptography, 2002, 27 : 261 - 269
  • [46] Improved upper bounds on sizes of codes
    Mounits, B
    Etzion, T
    Litsyn, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (04) : 880 - 886
  • [47] Averaging bounds for lattices and linear codes
    Loeliger, HA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) : 1767 - 1773
  • [48] Circuit lower bounds and linear codes
    Paturi R.
    Pudlák P.
    Journal of Mathematical Sciences, 2006, 134 (5) : 2425 - 2434
  • [49] Linear authentication codes: Bounds and constructions
    Wang, HX
    Xing, CP
    Safavi-Naini, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) : 866 - 872
  • [50] Linear Programming Bounds for Storage Codes
    Chan, Terence H.
    Tebbi, Mohammad Ali
    Sung, Chi Wan
    2013 9TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING (ICICS), 2013,
12345