Counting Extended Irreducible Goppa Codes
Abstract
We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree r and length qn+1, where q=pt and n and r>2 are prime numbers.
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.