Abstract
The so-called term-rank and rank metrics and appropriate codes were introduced and investigated in [1 –7]. These metrics and codes can be used for correcting array errors in a set of parallel channels, for scrambling in channels with burst errors, as basic codes in McEliece public key cryptosystem [8], etc. For codes with maximal rank distance (MRD codes) there exists a fast decoding algorithm based on Euclid's Division Algorithm in some non-commutative ring [6]. In this paper a new construction of MRD codes is given and a new fast matrix decoding algorithm is proposed which generalizes Peterson's algorithm [9] for BCH codes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Korzhik V.I., Gabidulin E.M. A Class of Two-Dimensional Codes Correcting Lattice-Pattern Errors.-In: The 2nd International Symposium on Information Theory, September 2–8, 1971, Tsahkadzor, Armenian SSR, Abstracts of papers, pp. 114–116.
Gabidulin E.M., Korzhik V.I. Codes Correcting Lattice-Pattern Errors. Izvestija vuz'ov, Radioelektronika, 1972, Vol. 15, No. 4, pp. 492–498 (in Russian).
Gabidulln E.M., Sidorenko V.R. Codes for a Set of Parallel Channels.-In: The 3rd International Symposium on Information Theory, Abstracts of papers, P. 2. Moscow-Tallinn, 1973, pp.54–57.
Gabidulin E.M., Sidorenko V.R. Codes for some memory channels.-In: The 4th International Symposium on Information Theory, Abstracts of papers, P. 2. Moscow-Leningrad, pp. 24–28.
Gabidulin E.M. Optimal Array-Error-Correction Codes.-In: The 6th International Symposium on Information Theory, Abstracts of papers, P. 2. Moscow-Tashkent, pp. 75–77.
Gabidulin E.M. Theory of Codes with Maximum Rank Distance.-Problems of Information Transmission (пРОБлЕМы пЕРЕДАЧИ ИНФОРМАцИИ — Problemy peredachi informatsii). Translated from Russian. C/B Consultants Bureau, New York, July 1985, pp. 1–12. Russian original Vol. 21, No. 1, January–March, 1985.
Gabidulin E.M. Optimal Codes Correcting Array Errors.-Problemy peredachi informatsii, 1985, vol. 21, No. 2 (in Russian).
Gabidulin E.M., Paramonov A.V., and Tretjakov O.V. Ideals over a Non-Commutative Ring and their Application in Cryptology.-Proceedings of Eurocrypt' 91.
Peterson W.W., Weldon E.J., Jr. Error-Correcting Codes. Second Edition, MIT Press, Cambridge, Mass. 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabidulin, E.M. (1992). A fast matrix decoding algorithm for rank-error-correcting codes. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034349
Download citation
DOI: https://doi.org/10.1007/BFb0034349
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive