2019/03/18 by Damian Dudzicz, Dudzicz, Damian, Fong, Silas L. +2 · 2 citations
Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1903.07434
openalex publication_date 2019/03/18 · openalex created_date 2020/07/16 · openalex updated_date 2026/07/28
This paper presents a new construction of error correcting codes which\nachieves optimal recovery of a streaming source over a packet erasure channel.\nThe channel model considered is the sliding window erasure model, with burst\nand arbitrary losses, introduced by Badr et al. . Recently, two independents\nworks by Fong et al. and Krishnan and Kumar have identified optimal streaming\ncodes within this framework. In this paper, we introduce streaming code when\nthe rate of the code is at least 1/2. Our proposed construction is explicit and\nsystematic, uses off-the-shelf maximum distance separable (MDS) codes and\nmaximum rank distance (MRD) Gabidulin block codes as constituent codes and\nachieves the optimal error correction. It presents a natural generalization to\nthe construction of Martinian and Sundberg to tolerate an arbitrary number of\nsparse erasures. The field size requirement which depends on the constituent\nMDS and MRD codes is also analyzed.\n