Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source
  Coding   We present a novel lossless universal source coding algorithm that uses
parallel computational units to increase the throughput. The length-$N$ input
sequence is partitioned into $B$ blocks. Processing each block independently of
the other blocks can accelerate the computation by a factor of $B$, but
degrades the compression quality. Instead, our approach is to first estimate
the minimum description length (MDL) source underlying the entire input, and
then encode each of the $B$ blocks in parallel based on the MDL source. With
this two-pass approach, the compression loss incurred by using more parallel
units is insignificant. Our algorithm is work-efficient, i.e., its
computational complexity is $O(N/B)$. Its redundancy is approximately
$B\log(N/B)$ bits above Rissanen's lower bound on universal coding performance,
with respect to any tree source whose maximal depth is at most $\log(N/B)$.

5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg