Abstract
In this paper an algorithm of complete decoding procedure for the Goppa codes with generater polynomialG(z)=z 2+z+β and parameters (2m, 2m, −2m, 5) is shown. The algorithm requires at mostm times calculating inner product of vectors overGF(2) and finding roots of quadratic equation inGF(2m). Form≤12, the algorithm has been realized.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. J. Macwilliams, and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.
D. C. Gorenstein, W. W. Peterson and N. Zierler,Infor. and Control, 3(1969), 291–4.
C. R. P. Hartmann,IEEE Trans. on IT,IT-17(1971), 765–6.
O. Mereno, Goppa Codes Related Quasi-Perfect Deuble-Error-Correcting Codes, Presented at IEEE Int. Symposium on Information Theory, Santa Monica, U. S. A., 1981.
G. L. Feng and K. K. Tseng, On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding, Presented at IEEE Int Symposium on Infermation Theory, St. Jovite, Quebic, Canada, 1983.
C. L. Chen,IEEE Trans. on IT,IT-28(1982), 792–4.
Author information
Authors and Affiliations
About this article
Cite this article
Guiliang, F. An algorithm of complete decoding of double-error-correcting goppa codes. J. of Electron. (China) 4, 241–246 (1987). https://doi.org/10.1007/BF02779031
Issue Date:
DOI: https://doi.org/10.1007/BF02779031