论文部分内容阅读
二元Goppa码是一大类很有用的纠错码。但是如何求二元Goppa码的真正最小距离至今没有解决。本文将导出二元Goppa码最小距离的新下限,这个新下限改进了Y.Sugiyama等(1976)和作者(1983)文章的结果。本文的方法不难推广到其他Goppa码中去。
Binary Goppa codes are a very useful class of error correction codes. But how to find the real minimum distance of binary Goppa code has not been solved so far. This article will derive a new lower bound for the minimum distance of binary Goppa codes, a new lower bound that improves the results of the article by Y. Sugiyama et al. (1976) and the author (1983). This method is not difficult to promote to other Goppa code.