English
Related papers

Related papers: Streaming Erasure Codes over Multi-Access Relayed …

200 papers

This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must…

Information Theory · Computer Science 2022-01-19 Gustavo Kasper Facenda , Elad Domanovitz , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the…

Information Theory · Computer Science 2022-03-14 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

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…

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

In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packets to the destination via the relay. The three-node D&F…

Information Theory · Computer Science 2022-11-30 Shubhransh Singhvi , Gayathri R. , P. Vijay Kumar

This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every…

Information Theory · Computer Science 2020-06-11 Elad Domanovitz , Ashish Khisti , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

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

This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the…

Information Theory · Computer Science 2019-11-12 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast…

Information Theory · Computer Science 2016-11-18 Ahmed Badr , Devin Lui , Ashish Khisti

This paper investigates streaming codes for 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-11-11 Zhipeng Li , Wenjie Ma

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

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the…

Information Theory · Computer Science 2022-03-08 Amjad Saeed Khan , Ioannis Chatzigeorgiou

We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a…

Information Theory · Computer Science 2016-11-17 Derek Leong , Tracey Ho

This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which…

Information Theory · Computer Science 2018-12-07 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos

This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While…

Information Theory · Computer Science 2020-05-14 Elad Domanovitz , Silas L. Fong , Ashish Khisti

Streaming erasure codes guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces a new class of streaming codes: Diversity Embedded Streaming Erasure Codes…

Information Theory · Computer Science 2011-02-22 Ahmed Badr , Ashish Khisti , Emin Martinian

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

A characterization of systematic network coding over multi-hop wireless networks is key towards understanding the trade-off between complexity and delay performance of networks that preserve the systematic structure. This paper studies the…

Networking and Internet Architecture · Computer Science 2016-11-18 Giuliano Giacaglia , Xiaomeng Shi , MinJi Kim , Daniel E. Lucani , Muriel Medard

Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces diversity embedded streaming erasure codes (DE-SCo),…

Information Theory · Computer Science 2010-07-13 Ahmed Badr , Ashish Khisti , Emin Martinian

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over…

Information Theory · Computer Science 2016-11-15 Joao Barros , Rui A. Costa , Daniele Munaretto , Joerg Widmer
‹ Prev 1 2 3 10 Next ›