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

  • G. L. Feng
  • K. K. Tzeng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 228)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    MacWilliams, F.J. and Sloane, N.J.A. (1977), The Theory of Error-Correcting Codes. North-Holland.Google Scholar
  2. (2).
    Gorenstein, D.C., Peterson, W.W., and Ziorler, N. (1960), Two-Error-Correcting Bose-Chaudhuri Codes are quasi-perfect. Information and Control 3, pp291–294.Google Scholar
  3. (3).
    Hartmann, C.R.P., A note on the decoding of double-error-correcting binary BCH codes of primitive length. IEEE Trans. Infor. Theory. 17(1971) pp 765–766.Google Scholar
  4. (4).
    Moreno, O., Goppa codes related quasi-perfect double-error-correcting codes. IEEE International Symposium on Information Theory, Santa Monica, USA. 1981.Google Scholar
  5. (5).
    Feng, G.L. and Tzeng, K.K., on quasi-perfect property of double-error-correcting Goppa codes and their complete decoding. Information and Control vol. 61 No. 2, May 1984 pp 132–146.Google Scholar
  6. (6).
    Chen, C.L. Formulas for the solutions of quadratic equations over GF(2m). IEEE Trans. Infor. Theory. 28(1982) pp 792–794.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • G. L. Feng
    • 1
  • K. K. Tzeng
    • 2
  1. 1.Shanghai Institute of Computer TechnologyP.R.China
  2. 2.Department of Computer Science and Electrical EngineeringLehigh UniversityU.S.A.

Personalised recommendations