Abstract
An isomorphism preserving Hamming distance between two algebraic geometry (AG) codes is presented to obtain the main parameters of Justesen’s algebraic geometry (JAG) codes. To deduce a simple approach to the decoding algorithm, a code word in a “small” JAG code is used to correspond to error-locator polynomial. By this means, a simple decoding procedure and its ability of error correcting are explored obviously. The lower and upper bounds of the dimension of AG codes are also obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Justesen et al.,IEEE Trans. on IT,IT-35(1989)4, 811–821.
S. K. Skorobogatov, S. G. Vladut,IEEE Trans. on IT,IT-36(1990)5, 1054–1060.
S. Iitaka, Algebraic Geometry, New York, Springer-Verlag, (1982), pp. 185–187.
R. Blahut, Theory and Practice of Error-Control Codes, MA: Addson-Wesley. (1983), pp. 180–200.
Author information
Authors and Affiliations
About this article
Cite this article
Peizhong, L., Guowen, S. On Justesen’s algebraic geometry codes. J. of Electron. (China) 10, 146–154 (1993). https://doi.org/10.1007/BF02684541
Issue Date:
DOI: https://doi.org/10.1007/BF02684541