Arbitrarily dirty paper coding and applications
A deterministic dirty-paper coding strategy for communication over an arbitrarily varying channel with an interference signal known to the transmitter is investigated. The presence of a known interference signal at the transmitter is shown to provide some protection against jamming interference. For some values of the parameters the scheme is capacity-achieving. Applications to watermarking and spectrum-sharing channels are described.