Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes   We consider lossy compression of a binary symmetric source by means of a
low-density generator-matrix code. We derive two lower bounds on the rate
distortion function which are valid for any low-density generator-matrix code
with a given node degree distribution L(x) on the set of generators and for any
encoding algorithm. These bounds show that, due to the sparseness of the code,
the performance is strictly bounded away from the Shannon rate-distortion
function. In this sense, our bounds represent a natural generalization of
Gallager's bound on the maximum rate at which low-density parity-check codes
can be used for reliable transmission. Our bounds are similar in spirit to the
technique recently developed by Dimakis, Wainwright, and Ramchandran, but they
apply to individual codes.

0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
19
The categories of this paper are: eess