English
Related papers

Related papers: Diversity Embedded Streaming Erasure Codes (DE-SCo…

200 papers

In a real-time transmission scenario, messages are transmitted through a channel that is subject to packet loss. The destination must recover the messages within the required deadline. In this paper, we consider a setup where two different…

Information Theory · Computer Science 2024-11-01 Dingli Yuan , Zhiquan Tan , Zhongyi Huang

Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to…

Information Theory · Computer Science 2007-07-13 Cheng Chang , Stark Draper , Anant Sahai

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…

Information Theory · Computer Science 2025-09-09 Zhipeng Li , Wenjie Ma , Zhifang Zhang

The Gilbert-Elliot (GE) channel is a commonly-accepted model for packet erasures in networks. Streaming codes are a class of packet-level erasure codes designed to provide reliable communication over the GE channel. The design of a…

Information Theory · Computer Science 2021-09-08 Myna Vajha , Vinayak Ramkumar , Mayank Jhamtani , P. Vijay Kumar

This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source transmits a sequence of message packets through a relay under a delay constraint of $T$ time slots per packet. The source-to-relay…

Information Theory · Computer Science 2024-01-29 Muhammad Ahmad Kaleem , Gustavo Kasper Facenda , Ashish Khisti

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Information Theory · Computer Science 2007-07-13 Hari Palaiyanur , Anant Sahai

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not…

Multimedia · Computer Science 2016-11-17 Nicolae Cleju , Nikolaos Thomos , Pascal Frossard

Streaming codes are a class of packet-level erasure codes that ensure packet recovery over a sliding window channel which allows either a burst erasure of size $b$ or $a$ random erasures within any window of size $(\tau+1)$ time units,…

Information Theory · Computer Science 2021-05-11 Myna Vajha , Vinayak Ramkumar , M. Nikhil Krishnan , P. Vijay Kumar

We consider streaming data transmission over a discrete memoryless channel. A new message is given to the encoder at the beginning of each block and the decoder decodes each message sequentially, after a delay of $T$ blocks. In this…

Information Theory · Computer Science 2015-12-22 Si-Hyeon Lee , Vincent Y. F. Tan , Ashish Khisti

We study video streaming over a slow fading wireless channel. In a streaming application video packets are required to be decoded and displayed in the order they are transmitted as the transmission goes on. This results in per-packet delay…

Information Theory · Computer Science 2015-10-12 Giuseppe Cocco , Deniz Gündüz , Christian Ibars

For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an…

Information Theory · Computer Science 2008-09-29 Jay Kumar Sundararajan , Devavrat Shah , Muriel Médard

An $(a,b,\tau)$ streaming code is a packet-level erasure code that can recover under a strict delay constraint of $\tau$ time units, from either a burst of $b$ erasures or else of $a$ random erasures, occurring within a sliding window of…

Information Theory · Computer Science 2020-05-15 Vinayak Ramkumar , Myna Vajha , M. Nikhil Krishnan , P. Vijay Kumar

One pervasive challenge in providing a high quality-of-service for live communication is to recover lost packets in real-time. Streaming codes are a class of erasure codes that are designed for such strict, low-latency streaming…

Information Theory · Computer Science 2023-02-28 Michael Rudow , K. V. Rashmi

In this paper, we investigate the optimal tradeoff between source and channel coding for channels with bit or packet erasure. Upper and Lower bounds on the optimal channel coding rate are computed to achieve minimal end-to-end distortion.…

Information Theory · Computer Science 2007-07-13 Sriram N. Kizhakkemadam , Panos Papamichalis , Mandyam Srinath , Dinesh Rajan

This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination through a relay. The source-to-relay and relay-to-destination links…

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing…

Networking and Internet Architecture · Computer Science 2008-03-06 Alexandros G. Dimakis , P. Brighten Godfrey , Yunnan Wu , Martin J. Wainwright , Kannan Ramchandran

Although HTTP-based video streaming can easily penetrate firewalls and profit from Web caches, the underlying TCP may introduce large delays in case of a sudden capacity loss. To avoid an interruption of the video stream in such cases we…

Multimedia · Computer Science 2016-05-13 Zakaria Ye , Rachid El-Azouzi , Tania Jimenez , Eitan Altman , Stefan Valentin

The demand for global video has been burgeoning across industries. With the expansion and improvement of video-streaming services, cloud-based video is evolving into a necessary feature of any successful business for reaching internal and…

Networking and Internet Architecture · Computer Science 2018-06-27 Abubakr O. Al-Abbasi , Vaneet Aggarwal

Characterization of the delay profile of systems employing random linear network coding is important for the reliable provision of broadcast services. Previous studies focused on network coding over large finite fields or developed Markov…

Information Theory · Computer Science 2022-03-08 Ioannis Chatzigeorgiou , Andrea Tassi

In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network…

Information Theory · Computer Science 2014-01-06 Amy Fu , Parastoo Sadeghi , Muriel Medard