Extended Irreducible Binary Sextic Goppa codes

Abstract

Let n (>3) be a prime number and F2n a finite field of 2n elements. Let L = F2n \∞\ be the support set and g(x) an irreducible polynomial of degree 6 over F2n. In this paper, we obtain an upper bound on the number of extended irreducible binary Goppa codes (L, g) of degree 6 and length 2n+1.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…