The Computational Complexity of Effective Construction of Geometric
Kaj S. Laursen · 1997
Recently algorithms for constructing Geometric Goppa codes have been described and im- plemented by Gaetan Hachi. (2). The central algo- rithms used are the blow-up of a singular curve and the Brill-Noether algorithm. In this paper the compu- tational complexity of these two algorithms are stud- ied.