Counting extended irreducible Goppa codes (Q5919148): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compact McEliece Keys from Goppa Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of inequivalent irreducible Goppa codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent irreducible Goppa codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Goppa and related codes invariant under a prescribed permutation / rank
 
Normal rank

Latest revision as of 18:00, 8 July 2024

scientific article; zbMATH DE number 6313263
Language Label Description Also known as
English
Counting extended irreducible Goppa codes
scientific article; zbMATH DE number 6313263

    Statements

    Counting extended irreducible Goppa codes (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    Summary: We produce an upper bound on the number of extended irreducible Goppa codes over any finite field.
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducible Goppa code
    0 references
    upper bound
    0 references
    cryptosystem
    0 references
    0 references
    0 references