Rate-Optimal Streaming Codes over Three-Node Relay Networks with Burst Erasures
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915484382789632 |
|---|---|
| author | Li, Zhipeng Ma, Wenjie Zhang, Zhifang |
| author_facet | Li, Zhipeng Ma, Wenjie Zhang, Zhifang |
| contents | This paper investigates streaming codes over three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most $b_1$ and $b_2$, respectively. Singhvi et al. proposed a construction achieving the optimal code rate when $\max\{b_1,b_2\}\mid (T-b_1-b_2)$. We construct streaming codes with the optimal rate under the condition
$T\geq b_1+b_2+\frac{b_1b_2}{|b_1-b_2|}$, thereby enriching the family of rate-optimal streaming codes for three-node relay networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_06912 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rate-Optimal Streaming Codes over Three-Node Relay Networks with Burst Erasures Li, Zhipeng Ma, Wenjie Zhang, Zhifang Information Theory This paper investigates streaming codes over three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most $b_1$ and $b_2$, respectively. Singhvi et al. proposed a construction achieving the optimal code rate when $\max\{b_1,b_2\}\mid (T-b_1-b_2)$. We construct streaming codes with the optimal rate under the condition $T\geq b_1+b_2+\frac{b_1b_2}{|b_1-b_2|}$, thereby enriching the family of rate-optimal streaming codes for three-node relay networks. |
| title | Rate-Optimal Streaming Codes over Three-Node Relay Networks with Burst Erasures |
| topic | Information Theory |
| url | https://arxiv.org/abs/2509.06912 |