DocumentCode :
938581
Title :
Modular curves and codes with a polynomial construction
Author :
Katsman, Gregory L. ; Tsfasman, Michael A. ; Vladut, Serge G.
Volume :
30
Issue :
2
fYear :
1984
fDate :
3/1/1984 12:00:00 AM
Firstpage :
353
Lastpage :
355
Abstract :
In this paper we study 
-ary codes arising from modular curves 
over GF 
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 -ary codes with 
are better than the Varshamov-Gilbert bound, and the binary codes are better than the Ziablov bounds.
-ary codes arising from modular curves over GF 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 -ary codes with are better than the Varshamov-Gilbert bound, and the binary codes are better than the Ziablov bounds.Keywords :
Block coding; Polynomial coding; Binary codes; Block codes; Equations; Error correction codes; Modular construction; TV; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056879
Filename :
1056879
Link To Document :
