Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomial complexity of polar codes for non-binary alphabets, key
  agreement and Slepian-Wolf coding   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.

5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph
15
The categories of this paper are: nucl-ex
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga