Papers › Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we design erasure-correcting codes for channels with burst and random erasures, when a strict decoding delay constraint is in place. We consider the sliding-window-based packet erasure model proposed by Badr et al., where any time-window of width w contains either up to a random erasures or an erasure burst of length at most b. One needs to recover any erased packet, where erasures are as per the channel model, with a strict decoding delay deadline of τ time slots. Presently existing rate-optimal constructions in the literature require, in general, a field-size which grows exponential in τ, for a constant a/τ. In this work, we present a new rate-optimal code construction covering all channel and delay parameters, which requires an O(τ²) field-size. As a special case, when (b-a)=1, we have a field-size linear in τ. We also present three other constructions having linear field-size, under certain constraints on channel and decoding delay parameters. As a corollary, we obtain low field-size, rate-optimal convolutional codes for any given column distance and column span. Simulations indicate that the newly proposed streaming code constructions offer lower packet-loss probabilities compared to existing schemes, for selected instances of Gilbert-Elliott and Fritchman channels.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections