Next: About this document
Up: No Title
Previous: No Title
References
- 1
-
V. D. Goppa:
Codes and Information:
Russian Math. Surveys, Vol.39, No. 1,
pp. 87-141, 1984.
- 2
-
V. D. Goppa:
Codes associated with divisors:
Problemy Peredachi Informatsii 13 (1977) 33-39.
- 3
-
V. D. Goppa:
Codes on algebraic curves:
Soviet
math. Dokl. 24 (1981) 75-91.
- 4
-
V. D. Goppa:
Algebraic-geometric codes:
Math. USSR Izvestiya 21 (1983) 75-91.
- 5
-
J. Justesen:
A class of constructive asymptotically good algebraic codes:
IEEE Trans. Infor. Theory,
Vol. IT-18, pp. 652-656, 1972.
- 6
-
M. A. Tsfasman, S. G. Vladut, and T. Zink:
Modular curves, Shimura curves and Goppa codes,
better than Varshamov-Gilbert bound:
Math. Nachr. 104 (1982) 13-28.
- 7
-
G. L. Katsman, M.A. Tsfasman and S. G. Vladut:
Modular curves and
codes with a polynomial construction:
IEEE Trans. Infor.
Theory,
Vol. IT-30, pp. 353-355, March 1984.
- 8
-
J. Justesen, K. J. Larsen, H. Elbrond Jensen, A. Havemose, and T. Hoholdt:
Construction
and decoding of a class of algebraic geometry codes:
IEEE Trans. Infor. Theory,
Vol. IT-35, pp. 811-821, July 1989.
- 9
-
A. N. Skorobogatov and S. G. Vladut:
On decoding of algebraic geometric
codes:
IEEE Trans. Infor. Theory,
Vol. IT-36, pp. 1051-1060, Sept. 1990.
- 10
-
V. Yu. Krachkovskii:
Decoding of codes on algebraic curves:
Odessa, preprint 1988.
- 11
-
R. Pellikaan:
On a decoding algorithm for codes on maximal curves:
IEEE Trans. Infor. Theory,
Vol. IT-35, pp. 1228-1232, Nov. 1989.
- 12
-
J. Justesen, K. J. Larsen, H. Elbrond Jensen, and T. Hoholdt:
Fast
decoding of codes from algebraic plane curves:
IEEE Trans. Infor. Theory,
Vol. IT-38, pp. 111-119, Jan. 1992.
- 13
-
S. C. Porter, B.-Z. Shen, and R. Pellikaan:
Decoding geometric Goppa codes using
an extra place:
IEEE Trans. on Information Theory, vol IT-38, No. 6, pp.
1663-1676, Nov. 1992.
- 14
-
I. M. Duursma:
Algebraic decoding using special divisors:
IEEE Trans. on
Infor. Theory. Vol. IT-39, pp. 694-698, March 1993.
- 15
-
G.L. Feng and T.R.N. Rao:
Decoding Algebraic Geometric Codes up to the Design
Minimum Distance:
Presented at
AAECC-9, 1991 and IEEE Trans. on Infor. Theory. Vol. IT-39, No.1, pp. 37-45, Jan. 1993.
- 16
-
D. Ehrhard:
Achieving the designed error capacity in decoding algebraic-geometric code:
IEEE Trans. on Infor. Theory. Vol. IT-39, No.3, pp. 743-751, May. 1993.
- 17
-
G.L. Feng, V.K. Wei, T.R.N. Rao, and K.K. Tzeng:
Simplified
Understanding and
Efficient Decoding of a Class of Algebraic-Geometric Codes:
IEEE Trans. on
Infor. Theory. Vol. IT-40, No.4, pp. 981-1002, July 1994.
- 18
-
G.L. Feng and T.R.N. Rao:
A Class of Algebraic Geometric Codes from Curves
in High-Dimensional Projective Spaces:
Lecture Notes in
Computer Science, 673 pp. 132-146, May, 1993.
- 19
-
R. E. Blahut:
AG codes without AG:
presented at 1992 IEEE Information Theory Workshop,
Salvador da
Bahia, Brazil, June 1992.
- 20
-
C. Kirfel and R. Pellikaan:
The minimum distance of codes in an array comming
from telescopic semigroups:
reprint, May 1993.
- 21
-
G.L. Feng and T.R.N. Rao:
A Simple Approach for Construction of Algebraic-Geometric Codes
from Affine Plane Curves:
IEEE Trans. on Infor.
Theory. Vol. IT-40, No.4, pp. 1003-1012, July 1994.
- 22
-
G.L. Feng and T.R.N. Rao:
Improved Geometric Goppa
Codes:
to appear in
IEEE Trans. on Infor.
Theory. 1995.
- 23
-
I. M. Duursma:
Majority coset decoding:
IEEE Trans. on
Infor. Theory. Vol. IT-39, pp. 1067-1071, May 1993.
- 24
-
G.L. Feng and K. K. Tzeng:
A New Procedure for Decoding Cyclic and BCH Codes
up to Actual Minimum Distance:
IEEE Trans. on Infor.
Theory. Vol. IT-40, No.5, pp. 1364-1374, Sept., 1994.
- 25
-
G.L. Feng and T.R.N. Rao:
Erasures-and-errors decoding of algebraic-geometric codes:
Proceedings of 1993 IEEE Infor. Theory Workshop pp.911-912,
June 1993.
- 26
-
S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Hoholdt:
Fast decoding
of algebraic-geometric codes up to half the designed minimum distance:
Proceedings of 1993 IEEE Infor. Theory Workshop pp.921-922, June 1993.
- 27
-
S. Sakata, H. E. Jensen, and T. Hoholdt:
Generalized Berlekamp-Massey
decoding of algebraic geometry codes up to half the Feng-Rao bound:
Proceedings of 1994 IEEE ISIT pp.154, June 1994.
- 28
-
B.Z. Shen and K.K. Tzeng:
Decoding geometric Goppa codes up to designed
minimum distance by solving a key equation in a ring:
Proceedings of 1994 IEEE ISIT pp.155, June 1994.
- 29
-
K. Saints, I. Rubion, and C. Heegard:
Decoding algebraic-geometric codes
using Grobner bases:
Proceedings of 1994 IEEE ISIT pp.156, June 1994.
- 30
-
A. Garcia and H. Stichtenoth:
A tower of Aritin-Schreier extensions of function fields attaining the
Drinfed-Vladut bound:
reprinted Dec 1994.
Ramesh Rao
Thu Jul 20 17:05:06 PDT 1995