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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01497013
Contributor : Hal Ifip <>
Submitted on : Tuesday, March 28, 2017 - 11:23:34 AM
Last modification on : Tuesday, March 28, 2017 - 11:36:18 AM
Long-term archiving on : Thursday, June 29, 2017 - 4:45:45 PM

File

978-3-642-40552-5_15_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

52

Files downloads

43