Nested Codes for Constrained Memory and for Dirty Paper

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 ecient coding and error-correction on such channels and memories.

• Type: Conference
• Year: 2006
• Where: AAECC
• Authors: Hans Georg Schaathun, Gérard D. Cohen
• Keywords: AAECC 2006, Algorithms, Dirty Paper, Dirty Paper Coding, So-called Nested Codes