Modular curves and codes with a polynomial construction

In this paper we study q -ary codes arising from modular curves X_{0}(11l) over GF (p^{2}) and some binary codes attached to them. All these codes have a polynomial construction and have "good" asymptotic parameters: for certain values of the parameters the q -ary codes with q = p^{2} \geq...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1984-03, Vol.30 (2), p.353-355
Main Authors: Katsman, G., Tsfasman, M., Vladut, S.
Format: Article
Language:English
Subjects:
Applied sciences
Coding, codes
Exact sciences and technology
Information, signal and communications theory
Signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we study q -ary codes arising from modular curves X_{0}(11l) over GF (p^{2}) and some binary codes attached to them. All these codes have a polynomial construction and have "good" asymptotic parameters: for certain values of the parameters the q -ary codes with q = p^{2} \geq 49 are better than the Varshamov-Gilbert bound, and the binary codes are better than the Ziablov bounds.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1984.1056879