On the [162,8,80] codes

被引：3
作者：
Boukliev, I
Dodunekov, SM
Helleseth, T
Ytrehus, O
机构：
[1] BULGARIAN ACAD SCI,INST MATH & INFORMAT,BU-1113 SOFIA,BULGARIA
[2] UNIV BERGEN,DEPT INFORMAT,HIB,N-5020 BERGEN,NORWAY
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 06期
关键词：
optimal binary codes;
D O I：
10.1109/18.641576
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Constructions of [162, 8, 80] and [159, 8, 78] codes are given. This solves the open problems of finding the minimum length of binary codes of dimension 8 and minimum distances 78 and 80, respectively.
引用
收藏
页码：2055 / 2057
页数：3
相关论文
共 19 条
[11]  
HELLESETH T, 1986, 21 U BERG DEP INF
[12]  
HELLESETH T, 1990, IEEE T INFORM THEORY, V36, P695
[13]  
HILL R, 1992, INST MATH C, V33, P75
[14]  
HILLE R, 1994, DES CODES CRYPTOGR, V4, P271
[15]  
JAFFE D, UNPUB BINARY LINEAR
[16]  
KOSTOVA BK, 1990, P 2 INT WORKSH ALG C, P113
[17]  
MacWilliams F.J., 1986, The Theory of Error-Correcting Codes
[18]   USING COMBINATORIAL OPTIMIZATION TO DESIGN GOOD UNIT-MEMORY CONVOLUTIONAL-CODES [J].
SAID, A ;
PALAZZO, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :1100-1108
[19]  
VANTILBORG HCA, 1981, DISCRETE MATH, V33, P197, DOI 10.1016/0012-365X(81)90166-7
12