Abstract
Leonard and Pellikaan developed the qth power algorithm to compute module bases for the integral closure of the polynomial ring F q [ x ] in a class of function fields. In this paper, their algorithm is adapted to efficiently obtain an F q -basis for a class of Riemann–Roch spaces without having to compute the entire integral closure. This reformulation allows one to determine the complexity of the algorithm. Further, we obtain a simple characterization of the integral closure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
