Chain of Separable Binary Goppa Codes and Their Minimal Distance
From MaRDI portal
(Redirected from Publication:3604913)
Abstract: It is shown that subclasses of separable binary Goppa codes, - codes, with and special Goppa polynomials G(x) can be presented as a chain of embedded codes. The true minimal distance has been obtained for all codes of the chain.
Recommendations
- Special classes of separable Goppa codes with improved parameter estimates
- Subclass of binary Goppa codes with minimal distance equal to the design distance
- scientific article; zbMATH DE number 4123672
- A (55,16,19) binary Goppa code and related codes having large minimum distance
- scientific article; zbMATH DE number 4041791
Cited in
(11)- scientific article; zbMATH DE number 4132088 (Why is no real title available?)
- A (55,16,19) binary Goppa code and related codes having large minimum distance
- Bounds on the Minimum Distance of Goppa Codes
- Subclass of binary Goppa codes with minimal distance equal to the design distance
- Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
- Weierstrass pairs and minimum distance of Goppa codes
- Improving the minimum distance bound of trace Goppa codes
- The new minimum distance bounds of Goppa codes and their decoding
- Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
- New identities relating wild Goppa codes
- Special classes of separable Goppa codes with improved parameter estimates
This page was built for publication: Chain of Separable Binary Goppa Codes and Their Minimal Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604913)