Advertisement

Journal of Electronics (China)

, Volume 4, Issue 4, pp 241–246 | Cite as

An algorithm of complete decoding of double-error-correcting goppa codes

  • Feng Guiliang
Article
  • 11 Downloads

Abstract

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.

Keywords

Quadratic Equation Shanghai Institute Normal Basis Primitive Element Nonsingular Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    F. J. Macwilliams, and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.Google Scholar
  2. [2]
    D. C. Gorenstein, W. W. Peterson and N. Zierler,Infor. and Control, 3(1969), 291–4.CrossRefMathSciNetGoogle Scholar
  3. [3]
    C. R. P. Hartmann,IEEE Trans. on IT,IT-17(1971), 765–6.MATHCrossRefGoogle Scholar
  4. [4]
    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
  5. [5]
    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
  6. [6]
    C. L. Chen,IEEE Trans. on IT,IT-28(1982), 792–4.MATHCrossRefGoogle Scholar

Copyright information

© Science Press 1987

Authors and Affiliations

  • Feng Guiliang
    • 1
  1. 1.Shanghai Institute of computer TechnologyShanghaiChina

Personalised recommendations