Binary optimal linear rate 1/2 codes

被引：11
|
作者：
Gulliver, TA
Östergård, PRJ
机构：
[1] Univ Victoria, Dept Elect & Comp Engn, STN, CSC, Victoria, BC V8W 3P6, Canada
[2] Helsinki Univ Technol, Dept Elect & Commun Engn, Helsinki 02015, Finland
来源：
DISCRETE MATHEMATICS | 2004年 / 283卷 / 1-3期
基金：
加拿大自然科学与工程研究理事会; 芬兰科学院;
关键词：
optimal binary linear codes; formally self-dual codes; code classification;
D O I：
10.1016/j.disc.2003.10.027
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we complete the classification of binary optimal linear [n, n/2] codes up to length 28. We have determined that there are 1535 inequivalent [14,7,4] codes, 1682 inequivalent [20,10,6] codes, and 3 inequivalent [26,13,7] codes. In addition. we show that the smallest length for which an optimal rate 1/2 code has a trivial automorphism group is 14. Double circulant codes which attain the highest known minimum distance are given for lengths up to 64. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：255 / 261
页数：7
相关论文
共 50 条
  • [31] Optimal binary linear codes containing the [6,5,2] ⊗ [3,1,3] product code
    Esmaeili, M
    Yazdani, AR
    Gulliver, TA
    ARS COMBINATORIA, 2005, 75 : 3 - 11
  • [32] On the algebraic representation of selected optimal non-linear binary codes
    Greferath, Marcus
    Zumbraegel, Jens
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [33] SOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES
    VANGILS, WJ
    PHILIPS JOURNAL OF RESEARCH, 1984, 39 (06) : 293 - 304
  • [34] OPTIMAL BINARY LINEAR LOCALLY REPAIRABLE CODES WITH DISJOINT REPAIR GROUPS
    Ma, Jingxue
    Ge, Gennian
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (04) : 2509 - 2529
  • [35] A Class of Distance-Optimal Binary Linear Codes With Flexible Parameters
    Tang, Deng
    Fan, Cuiling
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (09) : 1893 - 1896
  • [36] Improvements to the bounds on optimal binary linear codes of dimensions 11 and 12
    Gulliver, TA
    Bhargava, VK
    ARS COMBINATORIA, 1996, 44 : 173 - 181
  • [37] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE
    BAHL, LR
    COCKE, J
    JELINEK, F
    RAVIV, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) : 284 - 287
  • [38] Construction of Binary Locally Repairable Codes With Optimal Distance and Code Rate
    Wang, Jing
    Shen, Keqin
    Liu, Xiangyang
    Yu, Chunlei
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (07) : 2109 - 2113
  • [39] ROBUSTLY OPTIMAL RATE ONE-HALF BINARY CONVOLUTIONAL CODES
    JOHANNESSON, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) : 464 - 468
  • [40] A PERFORMANCE COMPARISON OF THE BINARY QUADRATIC RESIDUE CODES WITH THE 1/2-RATE CONVOLUTIONAL-CODES
    CHEN, XM
    REED, IS
    TRUONG, TK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (01) : 126 - 136
12345