Abstract
In this paper we investigate the number of minimum weight codewords of some dual algebraic-geometric codes associated with the Giulietti–Korchmaros maximal curve, by computing the maximal number of intersections between the Giulietti–Korchmaros curve and lines, plane conics, and plane cubics.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
