By Topic

Dirty Paper Coding with a Finite Input Alphabet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gariby, T. ; Department of Elect. Eng. - Systems, Tel-Aviv University, Email: ; Erez, U. ; Shamai, S.

We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty-paper channel. We examine the case of causal as well as non-causal side information.

Published in:

Electrical and Electronics Engineers in Israel, 2006 IEEE 24th Convention of

Date of Conference:

Nov. 2006