跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

This paper investigates streaming codes for three-node relay networks under burst packet erasures with a delay constraint TT. In any sliding window of T+1T+1 consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most b1b_1 and b2b_2, respectively. Let u=max⁡{b1,b2}u = \max\{b_1, b_2\} and v=min⁡{b1,b2}v = \min\{b_1, b_2\}. Singhvi et al. proposed a construction achieving the optimal rate when u∣(T−u−v)u\mid (T-u-v). In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint T−u−v2u−v≤⌊T−u−vu⌋\frac{T - u - v}{2u - v} \leq \left\lfloor \frac{T - u - v}{u} \right\rfloor and it strictly cover restriction u∣(T−u−v)u\mid (T-u-v). %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when 0<T−u−v<v0< T-u-v<v 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

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 TT. In any sliding window of T+1T+1 consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most b1b_1 and b2b_2, respectively. Let u=max⁡{b1,b2}u = \max\{b_1, b_2\} and v=min⁡{b1,b2}v = \min\{b_1, b_2\}. Singhvi et al. proposed a construction achieving the optimal rate when u∣(T−u−v)u\mid (T-u-v). In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint T−u−v2u−v≤⌊T−u−vu⌋\frac{T - u - v}{2u - v} \leq \left\lfloor \frac{T - u - v}{u} \right\rfloor and it strictly cover restriction u∣(T−u−v)u\mid (T-u-v). %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when 0<T−u−v<v0< T-u-v<v under the convolutional code framework.

查看此版本解读 →查看此版本原文 ↗