Totally decomposed cumulative Goppa codes with improved estimations

DOI10.1007/S10623-018-0566-2MaRDI QIDQ1727369zbMATH OpenOpenAlexWikidataFDO

Authors Sergey Bezzateev, Natalia A. Shekhunova

Publication date 20 February 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-018-0566-2

zbMATH Keywords

Goppa codestotally decomposed Goppa codeswild Goppa codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Special classes of separable Goppa codes with improved parameter estimates
• Bounds on the Minimum Distance of Goppa Codes
• On the parameters of Goppa codes
• Parameters of Goppa codes revisited
• New identities relating wild Goppa codes

Cites work

• scientific article; zbMATH DE number 3458474 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Further results on Goppa codes and their applications to constructing efficient binary codes
• Lower bound of covering radius of binary irreducible Goppa codes
• New identities relating wild Goppa codes
• Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
• Special classes of separable Goppa codes with improved parameter estimates
• Subclass of binary Goppa codes with minimal distance equal to the design distance
• Wild McEliece Incognito

Cited in

(2)

• Special classes of separable Goppa codes with improved parameter estimates
• \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}

Describes a project that uses

Uses Software

• Code Tables

This page was built for publication: Totally decomposed cumulative Goppa codes with improved estimations

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