nach oben

Designs, Codes and Cryptography

Erschienen in:

21.03.2020

A geometric approach to rank metric codes and a classification of constant weight codes

verfasst von: Tovohery Hajatiana Randrianarisoa

Erschienen in: Designs, Codes and Cryptography | Ausgabe 7/2020

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code and we give their generalized rank weights.

Vorheriger Artikel Affine equivalence for quadratic rotation symmetric Boolean functions

Nächster Artikel On optimal weak algebraic manipulation detection codes and weighted external difference families

Bonisoli A.: Every equidistant linear code is a sequence of dual Hamming codes. ARS Comb. 18, 181–186 (1983).MathSciNetMATH

Cai N., Yeung R.W.: Secure network coding. In: Proceedings IEEE International Symposium on Information Theory, p. 323 (2002). https://doi.org/10.1109/ISIT.2002.1023595.

Csajbók B., Marino G., Polverino O., Zullo F.: Maximum scattered linear sets and MRD-codes. J. Algebr. Comb. 46(3), 517–531 (2017). https://doi.org/10.1007/s10801-017-0762-6.MathSciNetCrossRefMATH

Csajbók B., Marino G., Polverino O., Zullo F.: A special class of scattered subspaces (2019).

Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978). https://doi.org/10.1016/0097-3165(78)90015-8.MathSciNetCrossRefMATH

Ducoat J., Kyureghyan G.: Generalized rank weights: a duality statement. Top. Finite Fields 632, 101–109 (2015).MathSciNetMATH

El Rouayheb S.Y., Soljanin E.: On wiretap networks II. In: 2007 IEEE International Symposium on Information Theory, pp. 551–555 (2007).https://doi.org/10.1109/ISIT.2007.4557098.

Gabidulin E.: Theory of codes with maximum rank distance (translation). Problems Inform. Transm. 21, 1–12 (1985).MathSciNetMATH

Gabidulin E.M., Paramonov A.V., Tretjakov O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies D.W. (ed.) Advances in Cryptology—EUROCRYPT ’91, pp. 482–489. Springer, Berlin (1991).CrossRef

10.

Giuzzi L., Zullo F.: Identifiers for MRD-codes. Linear Algebra Appl. 575, 66–86 (2019). https://doi.org/10.1016/j.laa.2019.03.030.MathSciNetCrossRefMATH

11.

Helleseth T., Kløve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths \(n_1((q^1-1)N)\). Discret. Math. 18(2), 179–211 (1977). https://doi.org/10.1016/0012-365X(77)90078-4.CrossRefMATH

12.

Hill R.: Caps and codes. Discret. Math. 22(2), 111–137 (1978). https://doi.org/10.1016/0012-365X(78)90120-6.MathSciNetCrossRefMATH

13.

Jurrius R., Pellikaan R.: The extended and generalized rank weight enumerator of a code. ACM Commun. Comput. Algebra 49(1), 21–21 (2015). https://doi.org/10.1145/2768577.2768605.CrossRefMATH

14.

Jurrius R., Pellikaan R.: On defining generalized rank weights. Adv. Math. Commun. 11, 225 (2017). https://doi.org/10.3934/amc.2017014.MathSciNetCrossRefMATH

15.

Kurihara J., Matsumoto R., Uyematsu T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inform. Theory 61(7), 3912–3936 (2015). https://doi.org/10.1109/TIT.2015.2429713.MathSciNetCrossRefMATH

16.

Lavrauw M., Van de Voorde G.: Field reduction and linear sets in finite geometry. Top. Finite Fields 632, 271–293 (2015).MathSciNetMATH

17.

Liu Z., Chen W.: Notes on the value function. Des. Codes Cryptogr. 54(1), 11 (2009). https://doi.org/10.1007/s10623-009-9305-z.MathSciNetCrossRefMATH

18.

Lunardon G.: Normal spreads. Geom. Dedicata 75(3), 245–261 (1999). https://doi.org/10.1023/A:1005052007006.MathSciNetCrossRefMATH

19.

Lunardon G.: MRD-codes and linear sets. J. Comb. Theory Ser. A 149, 1–20 (2017). https://doi.org/10.1016/j.jcta.2017.01.002.MathSciNetCrossRefMATH

20.

Martínez-Peñas U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inform. Theory 62(7), 4081–4095 (2016). https://doi.org/10.1109/TIT.2016.2570238.MathSciNetCrossRefMATH

21.

Morrison K.: Equivalence for rank-metric and matrix codes and automorphism groups of Gabidulin codes. IEEE Trans. Inform. Theory 60(11), 7035–7046 (2014). https://doi.org/10.1109/TIT.2014.2359198.MathSciNetCrossRefMATH

22.

Oggier F., Sboui A.: On the existence of generalized rank weights. In: 2012 International Symposium on Information Theory and its Applications, pp. 406–410 (2012).

23.

Ozarow L.H., Wyner A.D.: Wire-tap Channel II. In: Beth T., Cot N., Ingemarsson I. (eds.) Advances in Cryptology, pp. 33–50. Springer, Berlin (1985).CrossRef

24.

Polverino O.: Linear sets in finite projective spaces. Discret. Math. 310(22), 3096–3107 (2010). https://doi.org/10.1016/j.disc.2009.04.007. (Combinatorics 2008).MathSciNetCrossRefMATH

25.

Ravagnani A.: Generalized weights: an anticode approach. J. Pure Appl. Algebra 220(5), 1946–1962 (2016). https://doi.org/10.1016/j.jpaa.2015.10.009.MathSciNetCrossRefMATH

26.

Sheekey J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10, 475 (2016). https://doi.org/10.3934/amc.2016019.MathSciNetCrossRefMATH

27.

Sheekey J.: Mrd codes: constructions and connections. In: Schmidt K.U., Winterhof A. (eds.) Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications, vol. 23, pp. 255–286. De Gruyter, Berlin (2019). (chap. 13).CrossRef

28.

Sheekey J.: New semifields and new MRD codes from skew polynomial rings. J. Lond. Math. Soc. (2019). https://doi.org/10.1112/jlms.12281.CrossRefMATH

29.

Sheekey J., Van de Voorde G.: Rank-metric codes, linear sets, and their duality. Des. Codes Cryptogr. (2019). https://doi.org/10.1007/s10623-019-00703-z.

30.

Tsfasman M.A., VlăduŢ S.G.: Codes and Their Parameters, pp. 5–35. Springer, Dordrecht (1991). https://doi.org/10.1007/978-94-011-3810-9_1.CrossRef

31.

Tsfasman M.A., Vladut S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41(6), 1564–1588 (1995).MathSciNetCrossRef

32.

Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37(5), 1412–1418 (1991). https://doi.org/10.1109/18.133259.MathSciNetCrossRefMATH

Titel: A geometric approach to rank metric codes and a classification of constant weight codes
verfasst von: Tovohery Hajatiana Randrianarisoa
Publikationsdatum: 21.03.2020
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 7/2020
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-020-00750-x

Springer Professional

A geometric approach to rank metric codes and a classification of constant weight codes

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 7/2020

Affine equivalence for quadratic rotation symmetric Boolean functions

On optimal weak algebraic manipulation detection codes and weighted external difference families

Cryptanalysis of a system based on twisted Reed–Solomon codes

Longest subsequences shared by two de Bruijn sequences

Revisiting Gilbert’s known-key distinguisher

IBE with tight security against selective opening and chosen-ciphertext attacks

Premium Partner