nach oben

Designs, Codes and Cryptography

Erschienen in:

09.05.2018

Constructions of optimal Ferrers diagram rank metric codes

verfasst von: Tao Zhang, Gennian Ge

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2019

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

Subspace codes and constant dimension codes have become a widely investigated research topic due to their significance to error control in random linear network coding. Rank metric codes in Ferrers diagrams can be used to construct good subspace codes and constant dimension codes. In this paper, three constructions of Ferrers diagram rank metric codes are presented. The first two constructions are based on subcodes of maximum rank distance codes, and the last one generates new codes from known Ferrers diagram rank metric codes. Each of these constructions produces optimal codes with different diagrams and parameters for which no optimal construction was known before.

Vorheriger Artikel Improved bounds on 2-frameproof codes with length 4

Nächster Artikel Publicly verifiable searchable symmetric encryption based on efficient cryptographic components

Bachoc C., Passuello A., Vallentin F.: Bounds for projective codes from semidefinite programming. Adv. Math. Commun. 7(2), 127–145 (2013).MathSciNetCrossRefMATH

Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978).MathSciNetCrossRefMATH

Etzion T., Gorla E., Ravagnani A., Wachter-Zeh A.: Optimal Ferrers diagram rank-metric codes. IEEE Trans. Inf. Theory 62(4), 1616–1630 (2016).MathSciNetCrossRefMATH

Etzion T., Silberstein N.: Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory 55(7), 2909–2919 (2009).MathSciNetCrossRefMATH

Etzion T., Silberstein N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inf. Theory 59(2), 1004–1017 (2013).MathSciNetCrossRefMATH

Etzion T., Vardy A.: Error-correcting codes in projective space. IEEE Trans. Inf. Theory 57(2), 1165–1173 (2011).MathSciNetCrossRefMATH

Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3–16 (1985).MathSciNetMATH

Gadouleau M., Yan Z.: Constant-rank codes and their connection to constant-dimension codes. IEEE Trans. Inf. Theory 56(7), 3207–3216 (2010).MathSciNetCrossRefMATH

Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579–3591 (2008).MathSciNetCrossRefMATH

Kohnert A., Kurz S.: Construction of large constant dimension codes with a prescribed minimum distance. In: Mathematical Methods in Computer Science. Lecture Notes in Computer Science, vol 5393, pp. 31–42. Springer, Berlin (2008).

10.

Silberstein N., Etzion T.: Enumerative coding for Grassmannian space. IEEE Trans. Inf. Theory 57(1), 365–374 (2011).MathSciNetCrossRefMATH

11.

Silberstein N., Etzion T.: Large constant dimension codes and lexicodes. Adv. Math. Commun. 5(2), 177–189 (2011).MathSciNetCrossRefMATH

12.

Silberstein N., Trautmann A.-L.: Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks. IEEE Trans. Inf. Theory 61(7), 3937–3953 (2015).MathSciNetCrossRefMATH

13.

Silberstein N., Trautmann A.-L.: New lower bounds for constant dimension codes. In: Proceedings of the IEEE International Symposium on Information Theory, pp. 514–518 (2013).

14.

Silva D., Kschischang F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479–5490 (2009).MathSciNetCrossRefMATH

15.

Silva D., Kschischang F.R., Kötter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951–3967 (2008).MathSciNetCrossRefMATH

16.

Skachek V.: Recursive code construction for random networks. IEEE Trans. Inf. Theory 56(3), 1378–1382 (2010).MathSciNetCrossRefMATH

17.

Trautmann A.-L., Rosenthal J.: New improvements on the Echelon-Ferrers construction. In: Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems, pp. 405–408 (2010).

18.

Xia S.-T., Fu F.-W.: Johnson type bounds on constant dimension codes. Des. Codes Cryptogr. 50(2), 163–172 (2009).MathSciNetCrossRefMATH

Titel: Constructions of optimal Ferrers diagram rank metric codes
verfasst von: Tao Zhang
Gennian Ge
Publikationsdatum: 09.05.2018
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-018-0491-4

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 1/2019

Self-dual codes better than the Gilbert–Varshamov bound

Publicly verifiable searchable symmetric encryption based on efficient cryptographic components

Secure simultaneous bit extraction from Koblitz curves

On the q-bentness of Boolean functions

How many weights can a linear code have?

Several classes of linear codes with a few weights from defining sets over