RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1982 Volume 18, Issue 3, Pages 3–6 (Mi ppi1231)

This article is cited in 2 papers

Information Theory and Coding Theory

Goppa Codes That Are Better Than the Varshamov–Gilbert Bound

M. A. Tsfasman


Abstract: It is shown that there exist an infinite series of $q$-ary linear Goppa codes that arise from objects of algebraic geometry, whose parameters are asymptotically higher (as $n\to\infty$) than the Varshamov–Gilbert bound.

UDC: 621.391.15

Received: 26.05.1981
Revised: 29.12.1981


 English version:
Problems of Information Transmission, 1982, 18:3, 163–166

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025