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

Probl. Peredachi Inf., 1987 Volume 23, Issue 4, Pages 19–34 (Mi ppi827)

This article is cited in 3 papers

Information Theory and Coding Theory

Spectra of Algebraic-Geometric Codes

G. L. Katsman, M. A. Tsfasman


Abstract: We derive bounds on the enumerator of an arbitrary algebraic-geometric code. We calculate in full the weight distribution of the code constructed from all the points of an elliptical curve. The weight distribution (the enumerator) is found to depend on the group of points of this curve and on an element of this group. The number of minimum-weight vectors is minimized both by elements and by curves. The possibility that such a code is an MDS code is explored.

UDC: 621.391.15

Received: 05.09.1987


 English version:
Problems of Information Transmission, 1987, 23:4, 262–275

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025