nach oben

Designs, Codes and Cryptography

Erschienen in:

15.11.2017

Flags of almost affine codes and the two-party wire-tap channel of type II

verfasst von: Trygve Johnsen, Hugues Verdure

Erschienen in: Designs, Codes and Cryptography | Ausgabe 9/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 describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues to relative generalized Hamming weights in the linear case.

Vorheriger Artikel On group codes with complementary duals

Nächster Artikel Fourier transforms and bent functions on finite groups

Britz T., Johnsen T., Mayhew D., Shiromoto K.: Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62(3), 331–341 (2012).MathSciNetCrossRefMATH

Britz T., Johnsen T., Martin J.: Chains, demi-matroids, and profiles. IEEE Trans. Inf. Theory 60(2), 986–991 (2014).MathSciNetCrossRefMATH

Gordon G.: On Brylawski’s generalized duality. Math. Comput. Sci. 6(2), 135–146 (2012).MathSciNetCrossRefMATH

Johnsen T., Verdure H.: Generalized Hamming weights for almost affine codes. IEEE Trans. Inf. Theory 63(4), 1941–1953 (2017).MathSciNetCrossRefMATH

Liu Z., Chen W., Luo Y.: The relative generalized Hamming weight of linear $q$-ary codes and their subcodes. Des. Codes Cryptogr. 48(2), 111–123 (2008).MathSciNetCrossRefMATH

Luo Y., Mitrpant C., Han Vinck A.J., Chen K.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inf. Theory 51(3), 1222–1229 (2005).MathSciNetCrossRefMATH

Oxley J.: Matroid Theory. Oxford University Press, New York (2011).CrossRefMATH

Ozarow L.H., Wyner A.D.: Wire-Tap Channel II. Advances in Cryptology (Paris, 1984). Lecture Notes in Computer Science, 209, pp. 33–50. Springer, Berlin (1985).

Simonis J., Ashikhmin A.: Almost affine codes. Des. Codes Cryptogr. 14(2), 179–197 (1998).MathSciNetCrossRefMATH

10.

Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412–1418 (1991).MathSciNetCrossRefMATH

11.

Zhuang Z., Dai B., Luo Y., Han Vinck A.J.: On the relative profiles of a linear code and a subcode. Des. Codes Cryptogr. 72(2), 219–247 (2014).MathSciNetCrossRefMATH

Titel: Flags of almost affine codes and the two-party wire-tap channel of type II
verfasst von: Trygve Johnsen
Hugues Verdure
Publikationsdatum: 15.11.2017
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 9/2018
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-017-0438-1

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 9/2018

Fourier transforms and bent functions on finite groups

Hadamard full propelinear codes of type Q; rank and kernel

Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes

Duality of codes supported on regular lattices, with an application to enumerative combinatorics

On the number of inequivalent Gabidulin codes

Zero-correlation attacks: statistical models independent of the number of approximations