betaFeedback

WorksComputer Science

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

Abstract

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.

Paper details

vlnc:W_jvjw29ak
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…