Subclass of binary Goppa codes with minimal distance equal to the design distance
From MaRDI portal
Publication:4838691
DOI10.1109/18.370170zbMath0827.94028OpenAlexW2002178205MaRDI QIDQ4838691
Sergei V. Bezzateev, Natalia A. Shekhunova
Publication date: 12 July 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.370170
Related Items
Constructions of asymmetric quantum alternant codes ⋮ Two classes of cyclic extended double-error-correcting Goppa codes ⋮ Totally decomposed cumulative Goppa codes with improved estimations ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ A new subclass of cyclic Goppa codes ⋮ Special classes of separable Goppa codes with improved parameter estimates ⋮ Proof of conjectures on the true dimension of some binary Goppa codes
