• DocumentCode
    3064164
  • Title

    The computational complexity of effective construction of geometric Goppa codes

  • Author

    Laursen, Kaj S.

  • Author_Institution
    Dept. of Math., Aalborg Univ., Denmark
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    380
  • Abstract
    Algorithms for constructing geometric Goppa codes have been described and implemented by Gaetan Hache (see PhD. thesis, Paris University). The central algorithms used are the blow-up of a singular curve and the Brill-Noether algorithm. The computational complexity of these two algorithms are studied
  • Keywords
    Goppa codes; computational complexity; geometric codes; Brill-Noether algorithm; blow-up algorithm; computational complexity; geometric Goppa codes; singular curve; Arithmetic; Computational complexity; Mathematics; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613317
  • Filename
    613317
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3064164