二元Goppa码最小距离的新下限
A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES
-
摘要: 二元Goppa码是一大类很有用的纠错码。但是如何求二元Goppa码的真正最小距离至今没有解决。本文将导出二元Goppa码最小距离的新下限,这个新下限改进了Y.Sugiyama等(1976)和作者(1983)文章的结果。本文的方法不难推广到其他Goppa码中去。
-
关键词:
Abstract: Binary Goppa codes are a large and powerful family of error-correcting codes. But how to find the true minimum distance of binary Goppa codes is not yet solved. This paper will give derivation of a new lower bound for the minimum distance of binary Goppa codes. This new lower bound improves the results obtained by Y. Sugiyama et al. (1976) and Feng Guiliang (1983). The method in this paper can be generalized for other Goppa codes easily. -
Y. Sugiyama, M. Kasahara, S. Hirasawa and T. Nameltawa, IEEE Trans. on IT, IT-22(1976), 518.[2]冯贵良,电子学报,11(1983)2, 65.[3]K. K. Tzeng and E. Zimmermann, IEEE Trans. on IT, IT-21(1975), 712.[4]冯贵良, K. K. Tzeng,中国科学,A辑8(1983),745.[5]C. Roos, IEEE Trans. on IT IT-29(1983), 330. -
计量
- 文章访问数: 1986
- HTML全文浏览量: 166
- PDF下载量: 366
- 被引次数: 0
下载:
