Applied Erasure Coding in Networks and Distributed Storage
Katina Kralevska

TL;DR
This paper explores advanced erasure coding techniques to improve data reliability and efficiency in networks and distributed storage, addressing challenges like header overhead, resource savings, and quality of service.
Contribution
It introduces new erasure code constructions and implementations tailored for large-scale storage and network applications, enhancing efficiency and reliability.
Findings
Developed binary and non-binary erasure codes for various applications.
Reduced header overhead in network coding.
Achieved resource savings in distributed storage systems.
Abstract
The amount of digital data is rapidly growing. There is an increasing use of a wide range of computer systems, from mobile devices to large-scale data centers, and important for reliable operation of all computer systems is mitigating the occurrence and the impact of errors in digital data. The demand for new ultra-fast and highly reliable coding techniques for data at rest and for data in transit is a major research challenge. Reliability is one of the most important design requirements. The simplest way of providing a degree of reliability is by using data replication techniques. However, replication is highly inefficient in terms of capacity utilization. Erasure coding has therefore become a viable alternative to replication since it provides the same level of reliability as replication with significantly less storage overhead. The present thesis investigates efficient constructions…
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.
Taxonomy
TopicsCooperative Communication and Network Coding · Caching and Content Delivery · Advanced Data Storage Technologies
