Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: $O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for
  Data Compression   This paper addresses the problem of data compression with local decoding and
local update. A compression scheme has worst-case local decoding $d_{wc}$ if
any bit of the raw file can be recovered by probing at most $d_{wc}$ bits of
the compressed sequence, and has update efficiency of $u_{wc}$ if a single bit
of the raw file can be updated by modifying at most $u_{wc}$ bits of the
compressed sequence. This article provides an entropy-achieving compression
scheme for memoryless sources that simultaneously achieves $ O(\log\log n) $
local decoding and update efficiency. Key to this achievability result is a
novel succinct data structure for sparse sequences which allows efficient local
decoding and local update. Under general assumptions on the local decoder and
update algorithms, a converse result shows that $d_{wc}$ and $u_{wc}$ must grow
as $ \Omega(\log\log n) $.

37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics