Feng Guiliang. A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES[J]. Journal of Electronics & Information Technology, 1985, 7(1): 13-19.
Citation:
Feng Guiliang. A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES[J]. Journal of Electronics & Information Technology, 1985, 7(1): 13-19.
Feng Guiliang. A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES[J]. Journal of Electronics & Information Technology, 1985, 7(1): 13-19.
Citation:
Feng Guiliang. A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES[J]. Journal of Electronics & Information Technology, 1985, 7(1): 13-19.
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.
DownLoad: