Binary quasi-cyclic Goppa codes

被引：8

作者：

Bommier, G ^{[1
]}

Blanchet, F ^{[1
]}

机构：

[1] Inst Natl Rech Informat & Automat, Codes, F-78153 Le Chesnay, France

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2000年 / 20卷 / 02期

关键词：

Goppa code; quasi-cyclic code; linear code;

D O I：

10.1023/A:1008327723647

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We obtain here a necessary and sufficient condition for a certain class of binary Goppa code to be quasi-cyclic. We also give another sufficient condition which is easier to check. We define a class of quasi-cyclic Goppa codes. We find the true dimension for a part of those quasi-cyclic codes. and also a class of extended quasi-cyclic codes the minimum distance of which is equal to the designed distance.

引用

页码：107 / 124

页数：18

共 16 条

[1]

BERLEKAMP ER, 1973, IEEE T INFORMATION T, V18, P404

[2] SUBCLASS OF BINARY GOPPA CODES WITH MINIMAL DISTANCE EQUAL TO THE DESIGN DISTANCE [J].

BEZZATEEV, SV ;

SHEKHUNOVA, NA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) :554-555

[3]

BEZZATEEV SV, 1994, IEEE T INFORMATION T, V40, P499

[4]

BOMBIERI E, 1996, AM J MATH, V88, P91

[5]

DUR A, 1988, LECT NOTES COMPUTER

[6]

Goppa V. D., 1970, PROBL PEREDACHI INF, V6, P24

[7]

Goppa VD., 1977, Problemy Peredai Informacii, V13, P33

[8]

McWilliams FJ, 1977, THEORY ERROR CORRECT

[9] SYMMETRIES OF BINARY GOPPA CODES [J].

MORENO, O .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (05) :609-612

[10]

SEGUIN GE, 1990, THEORY 1 GENERATOR Q

← 1 2 →