METTLE: Efficient Streaming Erasure Code with Peeling Decodability
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915789033963520 |
|---|---|
| author | Yu, Qianru Yang, Tianji Meng, Jingfan Xu, Jun |
| author_facet | Yu, Qianru Yang, Tianji Meng, Jingfan Xu, Jun |
| contents | In this work, we solve a long-standing open problem in coding theory with broad applications in networking and systems: designing an erasure code that simultaneously satisfies three requirements: (1) high coding efficiency, (2) low coding complexity, and (3) being a streaming code (defined as one with low decoding latency). We propose METTLE (Multi-Edge Type with Touch-less Leading Edge), the first erasure code to meet all three requirements. Compared to "streaming RaptorQ" (RaptorQ configured with a small source block size to ensure a low decoding latency), METTLE is only slightly worse in coding efficiency, but 47.7 to 84.6 times faster to decode. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_10020 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | METTLE: Efficient Streaming Erasure Code with Peeling Decodability Yu, Qianru Yang, Tianji Meng, Jingfan Xu, Jun Information Theory In this work, we solve a long-standing open problem in coding theory with broad applications in networking and systems: designing an erasure code that simultaneously satisfies three requirements: (1) high coding efficiency, (2) low coding complexity, and (3) being a streaming code (defined as one with low decoding latency). We propose METTLE (Multi-Edge Type with Touch-less Leading Edge), the first erasure code to meet all three requirements. Compared to "streaming RaptorQ" (RaptorQ configured with a small source block size to ensure a low decoding latency), METTLE is only slightly worse in coding efficiency, but 47.7 to 84.6 times faster to decode. |
| title | METTLE: Efficient Streaming Erasure Code with Peeling Decodability |
| topic | Information Theory |
| url | https://arxiv.org/abs/2602.10020 |