Abstract
Hermitian codes obtained from Hermitian curves are shown to be concatenated generalized Reed-Solomon codes. This interpretation of Hermitian codes is used to investigate their structure. An efficient encoding algorithm is given for Hermitian codes. A new general decoding algorithm is given and applied to Hermitian codes to give a decoding algorithm capable of decoding up to the full error correcting capability of the code.
Similar content being viewed by others
References
M.A. Tsfasman, S.G. Vladut, and Th. Zink. On Goppa codes which are better than the Varshamov-Gilbert bound, Math, Nachr. 109 (1982), pp. 21–28.
H. Stichtenoth, A note on Hermitian codes over GF(q 2), IEEE Trans. on Info. Theory Vol. 34, No. 5, Sept. 1988, pp. 1345–1348.
J.H. van Lint and G. van der Geer, Introduction to Coding Theory and Algebraic Geometry, DMV Seminar, Band 12, Birkhauser Verlag, 1988.
H.J. Tiersma, Remarks on codes from Hermitian curves, IEEE Trans. on Info. Theory Vol. 33, No. 4, July 1987, pp. 605–609.
J. Justesen, K.J. Larsen, H.E. Jensen, A. Havemose, and T. Hoholdt, Construction and decoding of algebraic geometric codes, IEEE Trans. on Info. Theory Vol. 35, July 1989, pp. 811–821.
A.N. Skorobogatov and S.G. Vladut, On the decoding of algebraic-geometric codes, Preprint, Inst. Problems of Information Transmission, 1988.
R. Pellikaan, On a decoding algorithm for codes on maximal curves, IEEE Trans. on Info. Theory Vol. 35, No. 6, Nov. 1989, pp. 1228–1232.
R. Blahut, Theory and Practice of Error-Correcting Codes, Addison Wesley, 1983.
Author information
Authors and Affiliations
Additional information
Communicated by S. Vanstone
This work is supported by a Natural Science and Engineering Research Council Grant A7382.
Rights and permissions
About this article
Cite this article
Yaghoobian, T., Blake, I.F. Hermitian codes as generalized Reed-Solomon codes. Des Codes Crypt 2, 5–17 (1992). https://doi.org/10.1007/BF00124208
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00124208