跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18137 · v1

Rate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks

首次提交 2026-11-13 21:06
版本更新 2026-11-13 21:06
雷达观测 2026-11-16 11:41
arXiv ↗PDF ↗

摘要

We study streaming codes for a three-node relay network with burst lengths b1,b2b_1,b_2 and an end-to-end decoding delay TT. Let u=max⁡{b1,b2}u=\max\{b_1,b_2\} and v=min⁡{b1,b2}v=\min\{b_1,b_2\}, and write T−v=pu+qT-v=pu+q, where T≥u+vT\ge u+v and 0≤q<u0\le q<u. We develop two binary constructions, SR and SR-2, using extended delay profiles that allow the relay to forward causally invertible combinations of current and past source symbols. The SR construction attains the non-adaptive rate upper bound whenever T−u−v2u−v≤⌊T−u−vu⌋. \frac{T-u-v}{2u-v}\le\left\lfloor\frac{T-u-v}{u}\right\rfloor. SR-2 enlarges this range under the sufficient condition q(v−q)≤(p−1)u(u−v). q(v-q)\le(p-1)u(u-v). These constructions complement the known divisibility and large-delay regimes. We also establish two limitations of systematic ordinary coordinate forwarding. First, it cannot attain the rate upper bound when 0<T−u−v<v0<T-u-v<v. Second, for equal burst lengths bb, it attains the bound if and only if b∣(T−2b)b\mid(T-2b); a quantitative upper bound gives a strictly positive rate gap in every nondivisible case. These converses allow nonlinear components and predetermined time variation within the stated ordinary-forwarding architecture. Existing adaptive schemes for equal bursts approach the same rate upper bound asymptotically using time-varying convolutional codes and lie outside the non-adaptive setting considered here.

作者备注:27 pages

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 21:06 · 最新观测版本

Rate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks

We study streaming codes for a three-node relay network with burst lengths b1,b2b_1,b_2 and an end-to-end decoding delay TT. Let u=max⁡{b1,b2}u=\max\{b_1,b_2\} and v=min⁡{b1,b2}v=\min\{b_1,b_2\}, and write T−v=pu+qT-v=pu+q, where T≥u+vT\ge u+v and 0≤q<u0\le q<u. We develop two binary constructions, SR and SR-2, using extended delay profiles that allow the relay to forward causally invertible combinations of current and past source symbols. The SR construction attains the non-adaptive rate upper bound whenever T−u−v2u−v≤⌊T−u−vu⌋. \frac{T-u-v}{2u-v}\le\left\lfloor\frac{T-u-v}{u}\right\rfloor. SR-2 enlarges this range under the sufficient condition q(v−q)≤(p−1)u(u−v). q(v-q)\le(p-1)u(u-v). These constructions complement the known divisibility and large-delay regimes. We also establish two limitations of systematic ordinary coordinate forwarding. First, it cannot attain the rate upper bound when 0<T−u−v<v0<T-u-v<v. Second, for equal burst lengths bb, it attains the bound if and only if b∣(T−2b)b\mid(T-2b); a quantitative upper bound gives a strictly positive rate gap in every nondivisible case. These converses allow nonlinear components and predetermined time variation within the stated ordinary-forwarding architecture. Existing adaptive schemes for equal bursts approach the same rate upper bound asymptotically using time-varying convolutional codes and lie outside the non-adaptive setting considered here.

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