二元Goppa碼最小距離的新下限
A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES
-
摘要: 二元Goppa碼是一大類很有用的糾錯(cuò)碼。但是如何求二元Goppa碼的真正最小距離至今沒(méi)有解決。本文將導(dǎo)出二元Goppa碼最小距離的新下限,這個(gè)新下限改進(jìn)了Y.Sugiyama等(1976)和作者(1983)文章的結(jié)果。本文的方法不難推廣到其他Goppa碼中去。
-
關(guān)鍵詞:
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]馮貴良,電子學(xué)報(bào),11(1983)2, 65.[3]K. K. Tzeng and E. Zimmermann, IEEE Trans. on IT, IT-21(1975), 712.[4]馮貴良, K. K. Tzeng,中國(guó)科學(xué),A輯8(1983),745.[5]C. Roos, IEEE Trans. on IT IT-29(1983), 330. -
計(jì)量
- 文章訪問(wèn)數(shù): 2007
- HTML全文瀏覽量: 173
- PDF下載量: 369
- 被引次數(shù): 0
下載:
