Related papers: Optimal Age over Erasure Channels
We consider a spectrum sharing problem where two users attempt to communicate over N channels. The Primary User (PU) has prioritized transmissions and its occupancy on each channel over time can be modeled as a Markov chain. The Secondary…
In this paper, we analyze the impact of different encoding schemes on the age of information (AoI) performance in a point-to-point system, where a source generates packets based on the status updates collected from multiple sensors and…
We consider a source monitoring a stochastic process with a transmitter to transmit timely information through a wireless ON/OFF channel to a destination. We assume that once the source samples the data, the sampled data has to be processed…
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…
Age of Information (AoI) is emerging as a novel metric for measuring information freshness in real-time monitoring systems. For computation-intensive status data, the information is not revealed until being processed. We consider a status…
We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand…
The Age of Incorrect Information (AoII) is studied within the context of remote monitoring a Markov source using variable-length stop-feedback (VLSF) coding. Leveraging recent results on the non-asymptotic channel coding rate, we consider…
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly…
This paper addresses the performance of space-time coding over fading channels with impulsive noise which is known to accurately capture network interference. We use the symmetric alpha stable noise distribution and adopt two models which…
Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit…
An encoder, subject to a rate constraint, wishes to describe a Gaussian source under squared error distortion. The decoder, besides receiving the encoder's description, also observes side information consisting of uncompressed source symbol…
The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the…
We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either…
As the reconstruction of the star-formation histories (SFH) of galaxies from spectroscopic data becomes increasingly popular, we explore the best age resolution achievable with stellar population synthesis (SPS) models, relying on different…
We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmit its update to the monitor, and transmission time for…
Transmission of a Gaussian source over a time-varying Gaussian channel is studied in the presence of time-varying correlated side information at the receiver. A block fading model is considered for both the channel and the side information,…
Scheduling the transmission of time-sensitive information from a source node to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users. A…
In this paper, we consider a status updating system where updates are generated at a constant rate at $K$ sources and sent to the corresponding recipients through a noise-free broadcast channel. We assume that perfect channel state…