nach oben

Designs, Codes and Cryptography

Erschienen in:

28.04.2017

Network coding with flags

verfasst von: Dirk Liebhold, Gabriele Nebe, Angeles Vazquez-Castro

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2018

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

We develop a network coding technique based on flags of subspaces and a corresponding network channel model. To define error correcting codes we introduce a new distance on the flag variety, the Grassmann distance on flags and compare it to the commonly used gallery distance for full flags.

Vorheriger Artikel A new series of large sets of subspace designs over the binary field

Nächster Artikel MDS 2D convolutional codes with optimal 1D horizontal projections

Abramenko P., Brown K.S.: Buildings Theory and Applications. Springer Graduate Texts in Mathematics, vol. 248. Springer, New York (2008).

Ahlswede R., Cai N., Li S.-Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204–1216 (2000).MathSciNetCrossRefMATH

Humphreys J.E.: Reflection Groups and Coxeter Groups. Cambridge Studies in Advanced Mathematics, vol. 29. Cambridge University Press, Cambridge (1990).

Jones A.R.: A combinatorial approach to the double cosets of the symmetric group with respect to Young subgroups. Eur. J. Combin. 17, 647–655 (1996).MathSciNetCrossRefMATH

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

Petersen T.K., Tenner B.E.: The depth of a permutation. J. Combin. 6, 145–178 (2015).MathSciNetCrossRefMATH

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

Sloane N.J.A. (ed): The On-Line Encyclopedia of Integer Sequences, published electronically at https://oeis.org (2016). Accessed 31 May 2016.

Taylor D.E.: The Geometry of the Classical Groups. Heldermann Verlag, Berlin (1992).MATH

10.

Vazquez-Castro M.A.: A geometric approach to dynamic network coding. In: IEEE Information Theory Workshop (2015).

Titel: Network coding with flags
verfasst von: Dirk Liebhold
Gabriele Nebe
Angeles Vazquez-Castro
Publikationsdatum: 28.04.2017
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2/2018
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-017-0361-5

Springer Professional

Network coding with flags

Abstract

Premium Partner

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 2/2018

Coding for locality in reconstructing permutations

On the genericity of maximum rank distance and Gabidulin codes

Extension of Overbeck’s attack for Gabidulin-based cryptosystems

Anticode-based locally repairable codes with high availability

MDS 2D convolutional codes with optimal 1D horizontal projections

Concatenation of convolutional codes and rank metric codes for multi-shot network coding

Premium Partner