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.

Advances in Communication Networking Volume 8115 of the series Lecture Notes in Computer Science pp 161-172

References in corpus (2)

• Optimal Solution for the Index Coding Problem Using Network Coding over GF(2)
• On the Index Coding Problem and its Relation to Network Coding and Matroid Theory

Cited by in corpus (2)

• Expanded Combinatorial Designs as Tool to Model Network Slicing in 5G
• Families of Optimal Binary Non-MDS Erasure Codes