Balanced XOR-ed Coding

@article{Kralevska2013BalancedXC,
  title={Balanced XOR-ed Coding},
  author={Katina Kralevska and D. Gligoroski and H. {\O}verby},
  journal={ArXiv},
  year={2013},
  volume={abs/1601.06327}
}
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. 
Joint balanced source and network coding
Families of Optimal Binary Non-MDS Erasure Codes
Applied Erasure Coding in Networks and Distributed Storage
On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields
Expanded Combinatorial Designs as Tool to Model Network Slicing in 5G

References

SHOWING 1-10 OF 23 REFERENCES
Low Complexity Encoding for Network Codes
Optimal solution for the index coding problem using network coding over GF(2)
  • Jalaluddin Qureshi, C. Foh, J. Cai
  • Computer Science, Mathematics
  • 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)
  • 2012
Weakly Secure Network Coding
A Random Linear Network Coding Approach to Multicast
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
On Linear Network Coding
Network coding
An algebraic approach to network coding
Random network coding on the iPhone: fact or fiction?
Combinatorial designs: constructions and analysis
...
1
2
3
...