Abstract
F-metrics are metrics based on projective sets. In this paper, construction of optimal codes for a special F-metric associated with a generalized Vandermonde matrix is given. Encoding and fast decoding algorithms are described. A public-key cryptosystem is considered as an example of a possible application of codes constructed.
Similar content being viewed by others
REFERENCES
Gabidulin, E.M. and Obernikhin, V.A., Vandermonde and {ie168-1F}-Metrics, in Proc. 8th Int. Workshop on Algebraic and Combinatorial Coding Theory, Tsarskoe Selo, Russia, 2002, pp. 124–127.
Gabidulin, E.M. and Simonis, J., Metrics Generated by Families of Subspaces, IEEE Trans. Inf. Theory, 1998, vol. 44, no. 5, pp. 1336–1341.
Sharma, B.D. and Kaushik, M.L., On Algebra of Sharma and Kaushik's Metric Inducing Partitions of ℤq, J. Combin. Inf. Syst. Sci., 1986, vol. 11, pp. 114.
Gabidulin, E.M., Combinatorial Metrics in Coding Theory, in Proc. 2nd Int. Sympos. on Information Theory, MoscowYerevan, 1971, pp. 39–43.
Gabidulin, E.M. and Bossert, M., Codes Resistant to the Phase Rotation, in Proc. 4th Sympos. on Communication and Applications, Charlotte Mason College, {pm Lake District, UK}, July 1997, pp. 253–257.
Gabidulin, E.M. and Bossert, M., Hard and Soft Decision Decoding of Phase Rotation Invariant Block Codes, in Proc. 1998 Int. Zurich Seminar on Broadband Communications: Accessing, Transmission, Networking. ETH Zurich, Switzerland, February, 1998.
Gabidulin, E.M. and Simonis, J., Perfect Codes for Metrics Generated by Primitive 2-Error-Correcting Binary BCH Codes, Probl. Peredachi Inf., 1999, vol. 35, no. 3, pp. 40–47 [Probl. Inf. Trans. (Engl.Transl.), 1999, vol. 35, no. 3, pp. 224-230].
Gabidulin, E.M., Theory of Codes with Maximal Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 316 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 112].
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz', 1979.
Niederreiter, H., Knapsack-Type Cryptosystem and Algebraic Coding Theory, Probl. Control Inf. Theory, vol. 15, no. 2, 1986, pp. 159–166.
Sidelnikov, V.M. and Shestakov, S.O., On Insecurity of Cryptosystems Based on Generalized Reed Solomon Codes, Diskr. Mat., 1992, vol. 4, no. 3, pp. 57–63.
Gabidulin, E., Ourivski, A., and Pavlouchkov, V., On the Modified Niederreiter Cryptosystem, in Proc.Information Theory and Networking Workshop, Metsovo, Greece, 1999, p. 50.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gabidulin, E.M., Obernikhin, V.A. Codes in the Vandermonde F-Metric and Their Application. Problems of Information Transmission 39, 159–169 (2003). https://doi.org/10.1023/A:1025165820188
Issue Date:
DOI: https://doi.org/10.1023/A:1025165820188