The number of extended irreducible binary Goppa codes of degree (2ℓ)m and length 2n+1
Augustine Musukwa · Open Journal of Discrete Applied Mathematics · 2019
Let n and ℓ be odd prime numbers such that ℓ = n and (ℓ, 2 n ± 1) = 1.We produce an upper bound on the number of inequivalent extended irreducible binary Goppa codes of degree (2ℓ) m , with m ≥ 1 and length 2 n + 1.