相关论文: Cache-Enabled Broadcast Packet Erasure Channels wi…
We consider the $N$-user broadcast erasure channel with $N$ unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the…
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…
Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security…
A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…
A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with…
This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and…
We consider the problem of designing decentralized schemes for coded caching. In this problem there are $K$ users each caching $M$ files out of a library of $N$ total files. The question is to minimize $R$, the number of broadcast…
In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed…
Coded-caching delivery is considered over a symmetric noisy broadcast channel whose state is unknown at the transmitter during the cache placement phase. In particular, the delivery phase is modeled by a state-dependent broadcast channel…
Consider a lossy packet network of queues, communicating over a wireless medium. This paper presents a throughput-optimal transmission strategy for a unicast network when feedback is available, which has the following advantages: It…
This paper focuses on the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter. The LPE-BC is a high-SNR approximation of the fading Gaussian BC recently proposed by Tse and…
In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded…
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We…
This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We…
We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two…
This paper presents a new achievable scheme for the K-user Linear Computation Broadcast Channel (K-LCBC). A K-LCBC comprises data stored on a server and K users, each aiming to retrieve a desired linear function of the data by leveraging…
Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required…
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…
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…