Lower bound of the covering radius of irreducible Goppa codes

DOI10.1016/j.endm.2017.02.010zbMath1429.94076OpenAlexW2595493818MaRDI QIDQ1743278

Natalia A. Shekhunova, Sergei V. Bezzateev

Publication date: 13 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.02.010

zbMATH Keywords

covering radiuslower boundGoppa codeserror-correcting codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bound of covering radius of binary irreducible Goppa codes
• Covering radius 1985-1994
• Linear error-block codes
• Which extended Goppa codes are cyclic?
• Cyclic (L,g)-codes
• Covering radius---Survey and recent results
• On extending Goppa codes to cyclic codes (Corresp.)
• Parameters of Goppa codes revisited
• Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)

This page was built for publication: Lower bound of the covering radius of irreducible Goppa codes