An algorithm of complete decoding of double-error-correcting goppa codes
- 11 Downloads
In this paper an algorithm of complete decoding procedure for the Goppa codes with generater polynomialG(z)=z 2+z+β and parameters (2 m , 2 m , −2m, 5) is shown. The algorithm requires at mostm times calculating inner product of vectors overGF(2) and finding roots of quadratic equation inGF(2 m ). Form≤12, the algorithm has been realized.
KeywordsQuadratic Equation Shanghai Institute Normal Basis Primitive Element Nonsingular Matrix
Unable to display preview. Download preview PDF.
- F. J. Macwilliams, and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.Google Scholar
- 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.Google Scholar
- 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.Google Scholar