2019/03/26 by Magamba, Kondwani, Ryan, John A.
#11T71 #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.1904.02791
We obtain upper bounds on the number of irreducible and extended irreducible Goppa codes over GF(p) of length q and q+1, respectively defined by polynomials of degree r, where q=pt and r≥ 3 is a positive integer.