A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES

被引：0

作者：

冯贵良 ^{[1
]}

机构：

[1] Shanghai Institute of Computer Technology

来源：

Journal of Electronics(China) | 1985年 / 03期

关键词：

一刀; A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES; Za; 一夕; BCH;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Binary Goppa codes are a large and powerful family of error-correcting codes. But how tofind the true minimum distance of binary Goppa codes is not solved yet. In this paper a new lowerbound for the minimum distance of binary Goppa codes is shown. This new lower bound improvesthe results in Y. Sugiyama (1976) and Fang Guiliang’s (1983) papers. The method in this paper canbe generalized to other Goppa codes easily.

引用

页码：188 / 194

页数：7