Parameters of Goppa codes revisited

DOI10.1109/18.641547zbMath1053.94562OpenAlexW2096489003MaRDI QIDQ4392382

Françoise Levy-dit-Vehel, Simon N. Litsyn

Publication date: 1997

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

Full work available at URL: https://semanticscholar.org/paper/fc904c4f6edf47325a353f00382609f096a31ee3

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)

Related Items (7)

A Summary of McEliece-Type Cryptosystems and their Security ⋮ On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve ⋮ Two classes of cyclic extended double-error-correcting Goppa codes ⋮ Lower bound of the covering radius of irreducible Goppa codes ⋮ Permutation groups, minimal degrees and quantum computing. ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ New bounds on the distance distribution of extended Goppa codes

This page was built for publication: Parameters of Goppa codes revisited