Counting extended irreducible Goppa codes

DOI10.1155/2014/871871MaRDI QIDQ5919148zbMATH OpenOpenAlexWikidataFDO

Authors John A. Ryan

Publication date 4 July 2014

Published in Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2014/871871

zbMATH Keywords

cryptosystemirreducible Goppa codeupper bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Linear codes (general theory) (94B05)

Review text

Summary: We produce an upper bound on the number of extended irreducible Goppa codes over any finite field.

Cites work

• Compact McEliece keys from Goppa codes
• Enumeration of inequivalent irreducible Goppa codes
• Equivalent irreducible Goppa codes (Corresp.)
• Goppa and related codes invariant under a prescribed permutation
• scientific article; zbMATH DE number 3480475 (Why is no real title available?)
• scientific article; zbMATH DE number 1284424 (Why is no real title available?)

Cited in

(3)

• Enumeration of inequivalent irreducible Goppa codes
• Enumeration of Extended Irreducible Binary Goppa Codes
• Counting extended irreducible Goppa codes

This page was built for publication: Counting extended irreducible Goppa codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919148)