Logo image
Open Research University homepage
Surrey researchers Sign in
Nested codes for constrained memory and for dirty paper
Conference presentation   Open access   Peer reviewed

Nested codes for constrained memory and for dirty paper

HG Schaathun and GD Cohen
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.3857 L, pp.307-316
2006

Abstract

Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to some classes of constrained memories, and we explore the binary so-called nested codes, which are used for efficient coding and error-correction on such channels and memories. © Springer-Verlag Berlin Heidelberg 2006.
pdf
fulltext213.11 kBDownloadView
Text Open Access

Metrics

Details

Logo image

Usage Policy