← 研踪 PaperTrailarXiv: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
摘要
We study streaming codes for a three-node relay network with burst lengths and an end-to-end decoding delay . Let and , and write , where and . 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 SR-2 enlarges this range under the sufficient condition 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 . Second, for equal burst lengths , it attains the bound if and only if ; 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
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 and an end-to-end decoding delay . Let and , and write , where and . 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 SR-2 enlarges this range under the sufficient condition 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 . Second, for equal burst lengths , it attains the bound if and only if ; 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.
查看此版本解读 →查看此版本原文 ↗