New criteria for MRD and Gabidulin codes and some rank-metric code constructions. (English) Zbl 1431.94151
Summary: It is well-known that maximum rank distance (MRD) codes can be constructed as generalized Gabidulin codes. However, it was unknown until recently whether other constructions of linear MRD codes exist. In this paper, we derive a new criterion for linear MRD codes as well as an algebraic criterion for testing whether a given linear MRD code is a generalized Gabidulin code. We then use the criteria to construct examples of linear MRD codes which are not generalized Gabidulin codes.
MSC:
| 94B05 | Linear codes (general theory) |
| 11T71 | Algebraic coding theory; cryptography (number-theoretic aspects) |
Keywords:
rank metric; Gabidulin codes; MRD codes; linearized polynomials; network coding; finite fieldsSoftware:
McElieceReferences:
| [1] | T. P. Berger, Isometries for rank distance and permutation group of Gabidulin codes,, IEEE Trans. Inf. Theory, 49, 3016 (2003) · Zbl 1285.94124 · doi:10.1109/TIT.2003.819322 |
| [2] | A. Cossidente, Non-linear maximum rank distance codes,, Des. Codes Crypt., 79, 597 (2016) · Zbl 1386.94112 · doi:10.1007/s10623-015-0108-0 |
| [3] | J. de la Cruz, Algebraic structures of MRD codes,, Adv. Math. Commun., 10, 499 (2016) · Zbl 1348.94102 · doi:10.3934/amc.2016021 |
| [4] | P. Delsarte, Bilinear forms over a finite field, with applications to coding theory,, J. Combin. Theory Ser. A, 25, 226 (1978) · Zbl 0397.94012 · doi:10.1016/0097-3165(78)90015-8 |
| [5] | E. M. Gabidulin, Theory of codes with maximum rank distance,, Probl. Peredachi Inf., 21, 3 (1985) · Zbl 0585.94013 |
| [6] | E. M. Gabidulin, Ideals over a non-commutative ring and their application in cryptology,, in Proc. 10th Ann. Int. Conf. Theory Appl. Crypt. Techn. EUROCRYPT’91, 482 (1991) · Zbl 0766.94009 · doi:10.1007/3-540-46416-6_41 |
| [7] | M. Giorgetti, Galois invariance, trace codes and subfield subcodes,, Finite Fields Appl., 16, 96 (2010) · Zbl 1191.94130 · doi:10.1016/j.ffa.2010.01.002 |
| [8] | A. Horlemann-Trautmann, Extension of Overbeck’s attack for Gabidulin based cryptosystems,, Des. Codes Crypt. (2017) · Zbl 1412.94179 · doi:10.1007/s10623-017-0343-7 |
| [9] | A. Kshevetskiy, The new construction of rank codes,, in Proc. Int. Symp. Inf. Theory (ISIT), 2105 (2005) |
| [10] | R. Lidl, <em>Introduction to Finite Fields and their Applications</em>,, Cambridge Univ. Press (1994) · Zbl 0820.11072 · doi:10.1017/CBO9781139172769 |
| [11] | P. Loidreau, Designing a rank metric based McEliece cryptosystem,, in Proc. 3rd Int. Conf. Post-Quantum Crypt. PQCrypto’10, 142 (2010) · Zbl 1284.94089 · doi:10.1007/978-3-642-12929-2_11 |
| [12] | K. Morrison, Equivalence for rank-metric and matrix codes and automorphism groups of Gabidulin codes,, IEEE Trans. Inf. Theory, 60, 7035 (2014) · Zbl 1360.94381 · doi:10.1109/TIT.2014.2359198 |
| [13] | J. Sheekey, A new family of linear maximum rank distance codes,, Adv. Math. Commun., 10, 475 (2016) · Zbl 1348.94087 · doi:10.3934/amc.2016019 |
| [14] | Z.-X. Wan, <em>Geometry of Matrices</em>,, World Scient. (1996) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
