On binary linear codes which satisfy the two-way chain condition

被引：10
作者：
Encheva, SB
机构：
[1] Stord/Haueesund College
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 03期
关键词：
binary linear codes; two-way chain condition; state complexity;
D O I：
10.1109/18.490573
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
General constructions of binary linear codes satisfying the two-way chain condition are found, Sufficient conditions for their existence are determined, Some of these codes are proven to be Z(4)-linear. An expression for their state complexity profile is also found, Cases, when such codes have covering radius R = t[n, k] are shown.
引用
收藏
页码：1038 / 1047
页数：10
相关论文
共 12 条
[1]  
ENCHEVA SB, 1994, P IEEE INT S INFORMA
[2]  
FORNEY GD, 1994, IEEE T INFORM THEORY, V40, P1753, DOI 10.1109/18.340453
[3]   DIMENSION LENGTH PROFILES AND TRELLIS COMPLEXITY OF LINEAR BLOCK-CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :1741-1752
[4]   ON THE COVERING RADIUS OF CODES [J].
GRAHAM, RL ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :385-401
[5]   THE Z4-LINEARITY OF KERDOCK, PREPARATA, GOETHALS, AND RELATED CODES [J].
HAMMONS, AR ;
KUMAR, PV ;
CALDERBANK, AR ;
SLOANE, NJA ;
SOLE, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) :301-319
[6]   ON THE OPTIMUM BIT ORDERS WITH RESPECT TO THE STATE COMPLEXITY OF TRELLIS DIAGRAMS FOR BINARY LINEAR CODES [J].
KASAMI, T ;
TAKATA, T ;
FUJIWARA, T ;
LIN, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) :242-245
[7]  
KLOVE T, 1994, UNPUB CODES SATISFYI
[8]   Lower bounds on trellis complexity of block codes [J].
Lafourcade, A ;
Vardy, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) :1938-1954
[9]  
MATTSON HJ, 1984, LECTURE NOTES COMPUT, V228, P90
[10]   BOUNDS ON THE DIMENSION OF CODES AND SUBCODES WITH PRESCRIBED CONTRACTION INDEX [J].
VARDY, A ;
SNYDERS, J ;
BEERY, Y .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1990, 142 :237-261
12