Balanced XOR-ed Coding - Advances in Communication Networking Access content directly
Conference Papers Year : 2013

Balanced XOR-ed Coding

Katina Kralevska
  • Function : Author
  • PersonId : 1004752
Danilo Gligoroski
  • Function : Author
  • PersonId : 999333
Harald Øverby
  • Function : Author
  • PersonId : 1004753

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.
Fichier principal
Vignette du fichier
978-3-642-40552-5_15_Chapter.pdf (318.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01497013 , version 1 (28-03-2017)

Licence

Attribution

Identifiers

Cite

Katina Kralevska, Danilo Gligoroski, Harald Øverby. Balanced XOR-ed Coding. 19th Open European Summer School (EUNICE), Aug 2013, Chemnitz, Germany. pp.161-172, ⟨10.1007/978-3-642-40552-5_15⟩. ⟨hal-01497013⟩
70 View
152 Download

Altmetric

Share

Gmail Facebook X LinkedIn More