New code parameters from Reed-Solomon subfield codes

被引：13

作者：

Bierbrauer, J ^{[1
]}

Edel, Y ^{[1
]}

机构：

[1] UNIV HEIDELBERG,INST MATH,D-69120 HEIDELBERG,GERMANY

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 03期

关键词：

BCH codes; cyclotomic cosets; extension; lengthening; optimal codes; orthogonal arrays; Reed-Solomon codes;

D O I：

10.1109/18.568704

中图分类号：

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

学科分类号：

0812 ;

摘要：

We determine the dimensions of subfield codes of Reed-Solomon codes and construct certain extensions and lengthenings of these codes. We start from the duals, using the language of orthogonal arrays. As a first result this allows us to obtain a fair number of improvements in the list of binary, ternary, and quaternary linear codes with largest known minimal distance.

引用

页码：953 / 968

页数：16

共 9 条

[1]

BICRBRAUER J, IN PRESS J STAT PLAN

[2]

BOUKLIEV I, UNPUB METHOD CONSTRU

[3] AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES [J].

BROUWER, AE ;

VERHOEFF, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) :662-677

[4] SUBFIELD SUBCODES OF MODIFIED REED-SOLOMON CODES [J].

DELSARTE, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) :575-576

[5] NEW BOUNDS ON BINARY LINEAR CODES OF DIMENSION 8 [J].

DODUNEKOV, SM ;

HELLESETH, T ;

MANEV, N ;

YTREHUS, O .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (06) :917-919

[6] NEW BINARY-CODES [J].

GRONEICK, B ;

GROSSE, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) :510-512

[7]

MacWilliams F. J., 1992, THEORY ERROR CORRECT

[8]

Redei L., 1970, LUCKENHAFTE POLYNOME

[9]

van Lint J. H., 1982, INTRO CODING THEORY

← 1 →