Counting extended irreducible binary Goppa codes of degree 2p and length 2^n+1 | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Counting extended irreducible binary Goppa codes of degree 2p and length 2^n+1

Identifier:nobleid.org/w1/20260515/463DF1D8

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/463DF1D8.svg?ark=w1%2F20260515%2F463DF1D8)](https://nobleid.org/work/w1/20260515/463DF1D8)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Augustine Musukwa

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy