Zero-Error Sum Modulo Two with a Common Observation
Information Theory
2021-03-23 v2 math.IT
Abstract
This paper investigates the classical modulo two sum problem in source coding, but with a common observation: a transmitter observes , the other transmitter observes , and the receiver wants to compute without error. Through a coupling argument, this paper establishes a new lower bound on the sum-rate when forms a Markov chain.
Cite
@article{arxiv.2102.00697,
title = {Zero-Error Sum Modulo Two with a Common Observation},
author = {Milad Sefidgaran and Aslan Tchamkerten},
journal= {arXiv preprint arXiv:2102.00697},
year = {2021}
}
Comments
Accepted for presentation at IEEE ITW 2020