Variations on information embedding in multiple access and broadcast channels

IEEE Transactions on Information Theory

Volumn 56, Issue 5, 2010, Pages 2225-2240

  Kotagiri, Shiva Prasad ^a   Laneman, J Nicholas ^b  

^a XILINX INC   (United States)

^b University of Notre Dame   (United States)

Author keywords

Broadcast channels; Information embedding; Irreversible information embedding; Multiple access channels; Reversible information embedding

Indexed keywords

BROADCAST CHANNELS; CAPACITY REGIONS; DEGRADED BROADCAST CHANNEL; EMBEDDED MESSAGES; EMBEDDED SIGNALS; EMBEDDING METHOD; HOST SIGNALS; INFORMATION EMBEDDING; LOSSLESS; MULTIPLE ACCESS; MULTIPLE ACCESS CHANNELS; OUTER BOUNDS;

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); RECOVERY;

DECODING;

EID: 77951585908     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2043771     Document Type: Article

References (34)

1. B. Chen, "Design and analysis of digital watermarking, information embedding, and data hiding systems, " Ph. D., Mass. Inst. Technol., Cambridge, MA, 2000.
2. B. Chen and G. W. Wornell, "Quantization index modulation: A class of provably good methods for digital watermarking and information embedding, " IEEE Trans. Inf. Theory, vol. 47, pp. 1423-1443, May 2001.
3. R. J. Anderson and F. A. P. Petitcolas, "On the limitsofsteganography, " IEEE J. Sel. Areas Commun., vol. 16, no. 4, pp. 474-484, May 1998.
4. M. D. Swanson, M. Kobayashi, and A. H. Tewfik, "Multimedia dataembedding and watermarking technologies, " in Proc. IEEE Int. Conf. Commun. (ICC), 1998, vol. 2, pp. 823-827.
5. S. I. Gel'fand and M. S. Pinsker, "Coding for channel with random parameters, " Probl. Contr. Inf. Theory, vol. 9, no. 1, pp. 19-31, 1980.
6. M. H. M. Costa, "Writing on dirty paper, " IEEE Trans. Inf. Theory, vol. IT-29, pp. 439-441, May 1983.
7. P. Moulin and J. O'Sullivan, "Information-theoretic analysis of information hiding, " IEEE Trans. Inf. Theory, vol. 49, pp. 563-593, 2003.
8. A. S. Cohen and A. Lapidoth, "The Gaussian watermarking game, " IEEE Trans. Inf. Theory, vol. 48, pp. 1639-1669, Jun. 2002.
9. T. Kalker and F. Willems, "Capacity bounds and constructions for reversible data-hiding, " in Proc. Int. Conf. Digital Signal Process., 2002, pp. 71-76.
10. T. Kalker and F. Willems, "Capacity bounds and constructions for reversible data-hiding, " in Proc. SPIE Int. Conf. Secur. Watermark. Multimed. Contents, 2003, vol. 5020, pp. 604-611.
11. A. Somekh-Baruch and N. Merhav, "On the error exponent and capacity games of private watermarking systems, " IEEE Trans. Inf. Theory, vol. 49, pp. 537-562, Mar. 2003.
12. A. Somekh-Baruch and N. Merhav, "On the capacity game of public watermarking system, " IEEE Trans. Inf. Theory, vol. 50, pp. 511-524, Mar. 2004.
13. A. Somekh-Baruch and N. Merhav, "On the capacity game of private fingerprinting systems under collusion attacks, " IEEE Trans. Inf. Theory, vol. 51, pp. 884-899, Mar.. 2005.
14. A. Maor and N. Merhav, "On joint information embedding and lossy compression, " IEEE Trans. Inf. Theory, vol. 51, pp. 2998-3008, Aug. 2005.
15. A. Maor and N. Merhav, "On joint information embedding and lossy compression in the presence of a memoryless attack, " IEEE Trans. Inf. Theory, vol. 51, pp. 3166-3175, 2005.
16. N. Merhav, "On joint coding for watermarking and encryption, " IEEE Trans. Inf. Theory, vol. 52, pp. 190-205, Jan. 2006.
17. S. I. Gel'fand and M. S. Pinsker, "On Gaussian channels with random parameters, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 1983.
18. Y. H. Kim, A. Sutivong, and S. Sigurjónsson, "Multiple user writing on dirty paper, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Chicago, IL, Jun. 27-Jul. 2, 2004.
19. A. Khisti, U. Erez, and G. W. Wornell, "Writing on many pieces of dirty paper at once: The binary case, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Chicago, IL, Jun. 27-Jul. 2, 2004.
20. S. Kotagiri and J. N. Laneman, "Achievable rates for multiple access channels with state information known at one encoder, " in Proc. Allerton Conf. Commun., Control, Comput., Monticello, IL, 2004.
21. Y. Steinberg, "Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information, " IEEE Trans. Inf. Theory, vol. 51, pp. 2867-2877, Aug. 2005.
22. Y. Cemal and Y. Steinberg, "Multiple access channel with partial state information at the encoders, " IEEE Trans. Inf. Theory, vol. IT-51, pp. 3992-4003, Nov. 2005.
23. S. A. Jafar, "Capacity with causal and noncausal side information - A unified view, " IEEE Trans. Inf. Theory, vol. 52, pp. 5468-5475, Dec. 2006.
24. S. Kotagiri and J. N. Laneman, "Multiple access channels with state information known at some encoders, " EURASIP J. Wireless Commun. Netw., vol. 2008, no. Article ID 450680, p. 14, 2008.
25. A. Somekh-Baruch, S. Shamai, and S. Verdu, "Cooperative encoding with asymmetric state information atthe transmitters, " in Proc. Allerton Conf. Commun., Control, Comput., 2006.
26. S. Kotagiri and J. N. Laneman, "Multiaccess channels with state known to one encoder: A case of degraded message sets, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Nice, France, Jun. 24-29, 2007.
27. A. Somekh-Baruch, S. Shamai, and S. Verdu, "Cooperative multiple access encoding with states available at one transmitter, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Nice, France, Jun. 24-29, 2007.
28. Y. Steinberg, "Reversible information embedding with compressed hosts at the decoder, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seattle, WA, Jul. 9-14, 2006.
29. W. Sun and E. Yang, "On achievable regions of public multiple-access Gaussian watermarking systems, " in Information Hiding. Berlin, Heidelberg: Springer, 2004, Lecture Notes in Comput. Sci., pp. 38-51.
30. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
31. I. Csiszár and J. Korner, Eds., Information Theory: Coding ThoTheoremsr Discrete Memoryless Systems New York, Academic, 1981.
32. S. Tung, "Multiterminal source coding, " Ph. D. dissertation, Cornell Univ., Ithaca, NY, 1978.
33. Y. Zhong, Y. Wang, F. Alajaji, and T. Linder, "On the Public Information Embedding Capacity Region Under Multiple Access Attacks, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Toronto, ON, Canada, Jul. 6-11, 2008.
34. Y. Zhong, Y. Wang, F. Alajaji, and T. Linder, "Inner and Outer Bounds for the Public Information Embedding Capacity Region Under Multiple Access Attacks, " Mathematics and Engineering Tech. Rep., Department of Mathematics and Statistics, Queens University, Kingston, Canada [Online]. Available: http://www.mast.queensu.ca/~fady/TR/TR10-embed-mac-cap. pdf.