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

共 6 条

[1] A [55,16,19] BINARY GOPPA CODE
LOELOEIAN, M
CONAN, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (05) : 773 - 773
[2] A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES
冯贵良
[J]. Journal of Electronics(China), 1985, (03) : 188 - 194
[3] A new binary code of length 16 and minimum distance 3
Milshtein, Moshe
[J]. INFORMATION PROCESSING LETTERS, 2015, 115 (12) : 975 - 976
[4] New Bounds on the Size of Binary Codes With Large Minimum Distance
Pang, James Chin-Jen
Mahdavifar, Hessam
Sandeep Pradhan, S.
[J]. IEEE Journal on Selected Areas in Information Theory, 2023, 4 : 219 - 231
[5] A note on binary completely regular codes with large minimum distance
Gillespie, Neil I.
[J]. DISCRETE MATHEMATICS, 2013, 313 (14) : 1532 - 1534
[6] Binary component codes construction of multilevel block modulation codes with a large minimum Euclidean distance
Tanabe, H
Salam, MA
Mitamura, M
Umeda, H
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (07) : 1521 - 1528

← 1 →