Title :
The computational complexity of effective construction of geometric Goppa codes
Author_Institution :
Dept. of Math., Aalborg Univ., Denmark
fDate :
29 Jun-4 Jul 1997
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;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613317
