Enumeration of irreducible and extended irreducible Goppa codes
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.