ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Practical Universal Data Exchange using Polar Codes

Banerjee, SS and Tyagi, H (2019) Practical Universal Data Exchange using Polar Codes. In: 2019 IEEE Information Theory Workshop, ITW 2019, 25-28, August 2019, Sweden.

[img] PDF
iee_inf_the_wor_2019.pdf - Published Version
Restricted to Registered users only

Download (352kB) | Request a copy
Official URL: https://dx.doi.org/10.1109/ITW44776.2019.8989022


In the multiparty data exchange problem, parties with correlated data seek to recover each-other's data. We study practical, universal schemes for this problem that accomplish data exchange using optimal rate communication for any distribution of observations. Our focus in this work is on binary symmetric distributions where each user observes bit sequences with uniform marginals. We consider binary symmetric Markov trees as a natural multiparty extension of the binary symmetric source and seek universally rate optimal algorithms for this family. Our main theoretical result is a completeness theorem which shows that any universal Slepian-Wolf scheme can be converted efficiently to a universal data exchange scheme for a subfamily of binary symmetric Markov trees. We instantiate this result using Polar codes. In particular, we provide a universal Slepian-Wolf code using Polar codes and use our reduction algorithm to convert it to a multiparty data exchange protocol. The resulting scheme provides the first practical construction of codes for universal data exchange, which we evaluate numerically.

Item Type: Conference Paper
Publication: 2019 IEEE Information Theory Workshop, ITW 2019
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: cited By 0; Conference of 2019 IEEE Information Theory Workshop, ITW 2019 ; Conference Date: 25 August 2019 Through 28 August 2019; Conference Code:157627
Keywords: Binary trees; Electronic data interchange; Trees (mathematics), Completeness theorems; Correlated data; Data exchange protocols; Exchange problems; Optimal algorithm; Reduction algorithms; Slepian-Wolf codes; Symmetric distributions, Codes (symbols)
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 18 Aug 2020 08:51
Last Modified: 18 Aug 2020 08:51
URI: http://eprints.iisc.ac.in/id/eprint/64916

Actions (login required)

View Item View Item