Technical Program

Paper Detail

Paper IDO.3.3
Paper Title On optimal weighted-sum rates for the modulo sum problem
Authors Chandra Nair, Yannan Wang, The Chinese University of Hong Kong, China
Session O.3: Multi-terminal Source Coding I
Presentation Lecture
Track Source Coding
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract In a seminal work Korner and Marton showed that for computing the module-two sum of doubly symmetric binary sources, linear codes achieved the optimal rates and outperformed random coding and binning based arguments. Korner also showed the optimality of Slepian-Wolf based random coding for the same problem for a different class of pairwise distributions. We show that the optimal sum-rate is given by linear codes for a larger class of binary distributions, thus extending the optimality results for this problem.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!