The computational complexity of effective construction of geometric Goppa codes
Keld Laursen · 2002
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.