SUBCLASS OF BINARY GOPPA CODES WITH MINIMAL DISTANCE EQUAL TO THE DESIGN DISTANCE

被引：16

作者：

BEZZATEEV, SV ^{[1
]}

SHEKHUNOVA, NA ^{[1
]}

机构：

[1] ST PETERSBURG ACAD AIR SPACE INSTRUMENTAT,ST PETERSBURG 190000,RUSSIA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1995年 / 41卷 / 02期

基金：

美国国家科学基金会;

关键词：

ERROR-CORRECTING CODES; GOPPA CODES; PARAMETERS OF GOPPA CODES;

D O I：

10.1109/18.370170

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A subclass of binary Goppa codes specified by a separable polynomial G(x) = x(l) + A and a subset L of elements of GF(2(m)) (no element of L mag be a root of G(x) and t \ (2(m)-1), A is a tth power in {GF(2(m))\{0}}, is studied. For such codes it is shown that their minimal distance is equal to the design distance d = 2t + 1.

引用

页码：554 / 555

页数：2

共 5 条

[1]

BEZZATEEV SV, 1989, PROBL INFORM TRANSM, V25, P98

[2] A TRANSFORM APPROACH TO GOPPA CODES [J].

LOELOEIAN, M ;

CONAN, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (01) :105-115

[3]

Macwilliams F. J., 1977, THEORY ERROR CORRECT

[4] EXPONENTIAL-SUMS AND GOPPA CODES .2. [J].

MORENO, CJ ;

MORENO, O .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (04) :1222-1229

[5] THE TRACE OPERATOR AND REDUNDANCY OF GOPPA CODES [J].

ROSEIRO, AM ;

HALL, JI ;

ADNEY, JE ;

SIEGEL, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :1130-1133

← 1 →