Which linear codes are algebraic-geometric?

Authors:
R. Pellikan;B. -Z. Shen;G. J.M. van Wee
Affiliations:
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands;-;-
Venue:
IEEE Transactions on Information Theory
Year:
1991

Citing 0
Cited 2

On the unique representation of very strong algebraic geometry codes

Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	754.84

Visualization

Abstract

An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If conditions are imposed on the degree of the divisor use, then criteria are derived for linear codes to be algebraic-geometric. In particular. the family of q-ary Hamming codes is investigated, and it is proven that only those with redundancy one or two and the binary (7,4,3) code are algebraic-geometric in this sense. For these codes. the authors explicitly give a curve, rational points, and a divisor. It is proven that this triple is in a certain sense unique in the case of the (7,4,3) code.