Related papers: Streaming Erasure Codes over Multi-Access Relayed …
We consider a line of terminals which is connected by packet erasure channels and where random linear network coding is carried out at each node prior to transmission. In particular, we address an online approach in which each terminal has…
We investigate a scheduling scheme incorporating network coding and channel varying information for the two-way relay networks. Our scheduler aims at minimizing the time span needed to send all the data of each source of the network. We…
We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…
Network coding is a novel solution that significantly improve the throughput and energy consumed of wireless networks by mixing traffic flows through algebraic operations. In conventional network coding scheme, a packet has to wait for…
We consider a two-relay network in which a source aims to communicate a confidential message to a destination while keeping the message secret from the relay nodes. In the first hop, the channels from the source to the relays are assumed to…
Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objects can flexibly handle skews in the request rates. Coding…
We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the…
Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the…
We investigate the binary-symmetric parallel-relay network where there is one source, one destination, and multiple relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the…
Inferring the quality of streaming video applications is important for Internet service providers, but the fact that most video streams are encrypted makes it difficult to do so. We develop models that infer quality metrics (\ie, startup…
The explosive demand of on-line video from smart mobile devices poses unprecedented challenges to delivering high quality of experience (QoE) over wireless networks. Streaming high-definition video with low delay is difficult mainly due to…
We investigate joint network and channel coding schemes for networks when relay nodes are not capable of performing channel coding operations. Rather, channel encoding is performed at the source node while channel decoding is done only at…
We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols…
We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message…
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…
This paper investigates the construction of linear network codes for broadcasting a set of data packets to a number of users. The links from the source to the users are modeled as independent erasure channels. Users are allowed to inform…
The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce distributed polynomial-time network codes in the presence of malicious nodes. Our codes…
We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be…
We examine the issue of separation and code design for networks that operate over finite fields. We demonstrate that source-channel (or source-network) separation holds for several canonical network examples like the noisy multiple access…
In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes performing network coding can decode the messages from sources…