鶹ýAV

Structured Index Coding Problem and Multi-Access Coded Caching

Submitted by admin on Mon, 10/28/2024 - 01:24

Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed by the union of several symmetric ICPs. We derive upper and lower bounds on the optimal server transmission rate for this class of ICPs and demonstrate that they differ by at most a factor of two.

On Streaming Codes With Unequal Error Protection

Submitted by admin on Mon, 10/28/2024 - 01:24

Error control codes for real-time interactive applications such as audio and video streaming must operate under strict delay constraints and be resilient to burst losses. Previous works have characterized optimal streaming codes that guarantee perfect and timely recovery of all source packets when the burst loss is below a certain maximum threshold. In this work, we generalize the notion of streaming codes to the unequal error protection (UEP) setting. Toward this end, we define two natural notions of streaming codes; symbol-level UEP and packet-level UEP.

Reliable Coded Caching Design Over Wireless Networks

Submitted by admin on Mon, 10/28/2024 - 01:24

In this paper, we will show how to interpret the coded caching design from error control coding perspective. It is shown that, when the cached and non-cached contents in the placement phase is thought of as the shortened system packets and the punctured system packets, respectively, while those coded contents transmitted in the delivery phase specify the parity packets, the coded caching design can be reformulated as a collaborative error control coding problem.

Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

Submitted by admin on Mon, 10/28/2024 - 01:24

We consider a distributed storage system with $n$ nodes, where a user can recover the stored file from any $k$ nodes, and study the problem of repairing $r$ partially failed nodes. We consider broadcast repair, that is, $d$ surviving nodes transmit broadcast messages on an error-free wireless channel to the $r$ nodes being repaired, which are then used, together with the surviving data in the local memories of the failed nodes, to recover the lost content.

Topological Content Delivery With Feedback and Random Receiver Cache

Submitted by admin on Mon, 10/28/2024 - 01:24

We study the problem of content delivery in two-user interference channels with altering topology, random available cache at the receivers, and delayed channel knowledge at the transmitters. We establish a new set of outer-bounds on the achievable rates when each receiver has access to a random fraction of the message intended for the other receiver, and when each transmitter is aware of which part of its own message is known to the unintended receiver.

Corrections to “Generalization Bounds via Information Density and Conditional Information Density” [Nov 20 824-839]

Submitted by admin on Mon, 10/28/2024 - 01:24

An error in the proof of the data-dependent tail bounds on the generalization error presented in Hellström and Durisi (2020) is identified, and a correction is proposed. Furthermore, we note that the absolute continuity requirements in Hellström and Durisi (2020) need to be strengthened to avoid measurability issues.