DeepAI AI Chat
Log In Sign Up

Zero-Error Sum Modulo Two with a Common Observation

by   Milad Sefidgaran, et al.

This paper investigates the classical modulo two sum problem in source coding, but with a common observation: a transmitter observes (X,Z), the other transmitter observes (Y,Z), and the receiver wants to compute X ⊕ Y without error. Through a coupling argument, this paper establishes a new lower bound on the sum-rate when X-Z-Y forms a Markov chain.


page 1

page 2

page 3

page 4


Analysis of Age of Incorrect Information under Generic Transmission Delay

This paper investigates the Age of Incorrect Information (AoII) in a com...

Two-terminal source coding with common sum reconstruction

We present the problem of two-terminal source coding with Common Sum Rec...

Quantum Lower Bound for a Tripartite Version of the Hidden Shift Problem

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quan...

Degrees of Freedom of the Bursty MIMO X Channel with Instantaneous Topological Information

We study the effects of instantaneous feedback of channel topology on th...

Optimal User Scheduling in Energy Harvesting Wireless Networks

We consider a wireless network where multiple energy harvesting transmit...

Hardware Fingerprinting for the ARINC 429 Avionic Bus

ARINC 429 is the most common data bus in use today in civil avionics. Ho...