← 研踪 PaperTrailarXiv:2511.06882 · v2
Rate-Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks With Burst Erasures
首次提交 2025-11-10 17:30
版本更新 2026-11-15 19:25
雷达观测 2026-11-17 19:15
摘要
This paper investigates streaming codes for three-node relay networks under burst packet erasures with a delay constraint . In any sliding window of consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most and , respectively. Let and . Singhvi et al. proposed a construction achieving the optimal rate when . In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint and it strictly cover restriction . %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when under the convolutional code framework.
作者备注:There is a flaw in the proof of the main result (Theorem 4, Section V). The proposed code construction fails to achieve the claimed rate optimality under the burst erasure and delay model. This manuscript is withdrawn to avoid incorrect conclusions being cited
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-15 19:25 · 最新观测版本
Rate-Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks With Burst Erasures
This paper investigates streaming codes for three-node relay networks under burst packet erasures with a delay constraint . In any sliding window of consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most and , respectively. Let and . Singhvi et al. proposed a construction achieving the optimal rate when . In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint and it strictly cover restriction . %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when under the convolutional code framework.
查看此版本解读 →查看此版本原文 ↗