Balanced XOR-ed Coding

Abstract : This paper concerns with the construction of codes over GF(2) which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR of packets with equal lengths, and is based on highly symmetrical and balanced designs. For certain setups and parameters, our approach offers additional plausible security properties: an adversary needs to eavesdrop at least max-flow links in order to decode at least one original packet.
Type de document :
Communication dans un congrès
Thomas Bauschert. 19th Open European Summer School (EUNICE), Aug 2013, Chemnitz, Germany. Springer, Lecture Notes in Computer Science, LNCS-8115, pp.161-172, 2013, Advances in Communication Networking. 〈10.1007/978-3-642-40552-5_15〉
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01497013
Contributeur : Hal Ifip <>
Soumis le : mardi 28 mars 2017 - 11:23:34
Dernière modification le : mardi 28 mars 2017 - 11:36:18
Document(s) archivé(s) le : jeudi 29 juin 2017 - 16:45:45

Fichier

978-3-642-40552-5_15_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Katina Kralevska, Danilo Gligoroski, Harald Øverby. Balanced XOR-ed Coding. Thomas Bauschert. 19th Open European Summer School (EUNICE), Aug 2013, Chemnitz, Germany. Springer, Lecture Notes in Computer Science, LNCS-8115, pp.161-172, 2013, Advances in Communication Networking. 〈10.1007/978-3-642-40552-5_15〉. 〈hal-01497013〉

Partager

Métriques

Consultations de la notice

24

Téléchargements de fichiers

14