A [55,16,19] BINARY GOPPA CODE AND RELATED CODES HAVING LARGE MINIMUM DISTANCE

被引：2

作者：

CAO, HT ^{[1
]}

DOUGHERTY, RL ^{[1
]}

JANWA, H ^{[1
]}

机构：

[1] OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 05期

关键词：

ERROR-CORRECTING CODES; GOPPA CODES; MINIMUM DISTANCE;

D O I：

10.1109/18.133263

中图分类号：

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

学科分类号：

0812 ;

摘要：

A [55,16,19] binary Goppa code is used to construct [57,17,17], [58,17,18], [59,17,19], and [60,17,20] codes. The first two codes have smaller redundancy than previously known codes (linear or nonlinear) of the same length and minimum distance, while the last two codes have parameters previously attained only by nonlinear codes.

引用

页码：1432 / 1433

页数：2

共 7 条

[1]

Bezzateev S. V., 1987, Problems of Information Transmission, V23

[2]

DOUGHERTY R, IN PRESS MATH COMPUT

[3] ON THE COVERING RADIUS OF CODES [J].