Unbounded Loss in Writing on Dirty Paper is Possible

Aaron S. Cohen, Ram Zamir. Unbounded Loss in Writing on Dirty Paper is Possible. In Piyush Gupta, Gerhard Kramer, Adriaan J. van Wijnggaarden, editors, Advances in Network Information Theory, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 17-19, 2003. Volume 66 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 79-86, DIMACS/AMS, 2003.

Abstract

Abstract is missing.