Chain of Separable Binary Goppa Codes and Their Minimal Distance

DOI10.1109/TIT.2008.2006442zbMATH Open1319.94098arXiv0707.4083OpenAlexW2132672447MaRDI QIDQ3604913FDOQ3604913

Authors: Sergey Bezzateev, Natalia A. Shekhunova 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: It is shown that subclasses of separable binary Goppa codes, $Gamma(L,G)$ - codes, with $L=alphainGF(2^{2l}):G(alpha)eq0$ 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.

Full work available at URL: https://arxiv.org/abs/0707.4083

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

zbMATH Keywords

Goppa codesminimal distance of separable binary codesquasi-cyclic Goppa codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Convolutional codes (94B10)

Cited In (10)

• Improving the minimum distance bound of trace Goppa codes
• Title not available (Why is that?)
• New identities relating wild Goppa codes
• Special classes of separable Goppa codes with improved parameter estimates
• Weierstrass pairs and minimum distance of Goppa codes
• Bounds on the Minimum Distance of Goppa Codes
• Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets
• A (55,16,19) binary Goppa code and related codes having large minimum distance
• The new minimum distance bounds of Goppa codes and their decoding
• Subclass of binary Goppa codes with minimal distance equal to the design distance

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)