TY - GEN
T1 - Zero-error sum modulo two with a common observation
AU - Sefidgaran, Milad
AU - Tchamkerten, Aslan
N1 - Publisher Copyright:
©2021 IEEE
PY - 2021/4/11
Y1 - 2021/4/11
N2 - 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.
AB - 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.
U2 - 10.1109/ITW46852.2021.9457672
DO - 10.1109/ITW46852.2021.9457672
M3 - Conference contribution
AN - SCOPUS:85113332622
T3 - 2020 IEEE Information Theory Workshop, ITW 2020
BT - 2020 IEEE Information Theory Workshop, ITW 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE Information Theory Workshop, ITW 2020
Y2 - 11 April 2021 through 15 April 2021
ER -