Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A lower bound on the data rate of dirty paper coding in general noise
  and interference   Dirty paper coding (DPC) allows a transmitter to send information to a
receiver in the presence of interference that is known (non-causally) to the
transmitter. The original version of DPC was derived for the case where the
noise and the interference are statistically independent Gaussian random
sequences. More recent works extended this approach to the case where the noise
and the interference are mutually independent and at least one of them is
Gaussian. In this letter we further extend the DPC scheme by relaxing the
Gaussian and statistical independence assumptions. We provide lower bounds on
the achievable data rates in a DPC setting for the case of possibly dependent
noise, interference and input signals. Also, the interference and noise terms
are allowed to have arbitrary probability distributions. The bounds are
relatively simple, are phrased in terms of second-order statistics, and are
tight when the actual noise distribution is close to Gaussian.

11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph