EXPONENTIAL-SUMS AND GOPPA CODES .1.

被引：84

作者：

MORENO, CJ ^{[1
]}

MORENO, O ^{[1
]}

机构：

[1] UNIV PUERTO RICO,DEPT MATH,RIO PIEDRAS,PR 00931

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 1991年 / 111卷 / 02期

关键词：

D O I：

10.2307/2048345

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new bound is used to estimate the covering radius of long binary Goppa codes. A new lower bound is also derived on the minimum distance of the dual of a binary Goppa code, similar to that for BCH codes. This is an example of the use of a number-theory bound for the problem of the estimation of minimum distance of codes, as posed in research problem 9.9 of MacWilliams and Sloane, The Theory of Error Correcting Codes.

引用

页码：523 / 531

页数：9

共 8 条

[1] ON EXPONENTIAL SUMS IN FINITE FIELDS [J].