ON THE MINIMUM DISTANCE OF A CYCLIC CODE.

被引：0

作者：

Roos, C.

机构：

来源：

Delft progress report | 1981年 / 6卷 / 03期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper it is shown that both the BCH bound and the Hartmann-Tzeng bound for the minimum distance of a cyclic code can be obtained quite easily as consequences of an elementary result on its defining set of zeros.

引用

页码：165 / 169

共 50 条

[1] A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF A CYCLIC CODE
ROOS, C
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 330 - 332
[2] REVERSIBLE PULSE COUNTER WITH CYCLIC CODE.
Korotynskii, A.E.
Gudzevatyi, V.V.
1978, 21 (4 pt 1): : 965 - 966
[3] A new bound for the minimum distance of a cyclic code from its defining set
Betti, Emanuele
Sala, Massimiliano
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3700 - 3706
[4] MODIFIED ALGORITHM FOR DETERMINING MINIMUM AND FREE DISTANCES OF A CONVOLUTIONAL CODE.
Mittra, Prabhat
Sinha, V.
IETE Journal of Research, 1981, 27 (03) : 103 - 105
[5] ON THE MINIMUM DISTANCE OF CYCLIC CODES
VANLINT, JH
WILSON, RM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) : 23 - 40
[6] DESIGN CODE.
Kung, Szu-Li
Batiment international, Building research & practice, 1985, 13 (06): : 356 - 360
[7] The phoenix code.
Cassada, J
LIBRARY JOURNAL, 2000, 125 (20) : 197 - 197
[8] The silk code.
不详
LIBRARY JOURNAL, 2000, 125 (10) : 240 - 240
[9] A lower bound on the minimum distance of a 1-generator quasi-cyclic code
Woungang, Isaac
Misra, Sudip
Sadeghian, Alireza
2006 23RD BIENNIAL SYMPOSIUM ON COMMUNICATIONS, 2006, : 63 - +
[10] On the minimum distance of a q-ary image of a q(m)-ary cyclic code
Sakakibara, K
Kasahara, M
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1631 - 1635

← 1 2 3 4 5 →