To refer to this page use:
|Abstract:||We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional entropy. This extends the recent results of Guruswami and Xia to a slightly more general setting, which in turn can be applied to (1) sources with non-binary alphabets, (2) key generation for discrete and Gaussian sources, and (3) Slepian-Wolf coding and multiple accessing. In each of these cases, the complexity scaling with respect to the number of users is also controlled. In particular, we construct coding schemes for these multi-user information theory problems which achieve optimal rates with an overall polynomial complexity.|
|Citation:||Liu, J, Abbe, E. (2014). Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding. 10.1109/CISS.2014.6814146|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||2014 48th Annual Conference on Information Sciences and Systems, CISS 2014|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.