Balanced XOR-ed Coding
Katina Kralevska, Danilo Gligoroski, Harald Oeverby

TL;DR
This paper introduces a new class of XOR-based codes over GF(2) for multicast networks that achieve maximum flow and offer enhanced security properties through symmetrical and balanced design principles.
Contribution
It presents a novel construction of XOR-coded multicast schemes using symmetrical, balanced designs that reach max-flow and provide security benefits.
Findings
Codes reach max-flow in multicast networks with delay
Codes are based on symmetrical, balanced designs
Enhanced security properties against eavesdropping
Abstract
This paper concerns with the construction of codes over 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
