Lattice costa schemes using subspace projection for digital watermarking

European Transactions on Telecommunications

Volumn 15, Issue 4, 2004, Pages 351-361

  Fischer, Robert F H ^a   Tzschoppe, Roman ^a   Bäuml, Robert ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DECODING; DIGITAL COMMUNICATION SYSTEMS; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

INFORMATION EMBEDDING; LATTICE COSTA SCHEME (LCS); SPREAD SPECTRUM TECHNIQUES; WATERMARK-TO-NOISE RATIO (WNR);

DIGITAL WATERMARKING;

EID: 4143083811     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.985     Document Type: Conference Paper

References (30)

1. Agrell E, Eriksson T, Vary A, Zeger K. Closest point search in lattices. IEEE Transactions on Information Theory 2002; IT-48(8); 2201-2214.
2. Balado F, Pérez-González F. Hexagonal quantizers are not optimal for 2-D data hiding. In Proceedings of SPIE Vol 5020: Security and Watermarking of Multimedia Contents IV, pp. 623-631, Santa Clara, CA, USA, January 2003.
3. Chen B, Wornell GW. Achievable performance of digital watermarking systems. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems (ICMCS'99), Vol. 1, pp. 13-18, Florence, Italy, June 1999.
4. Chen B, Wornell G. Preprocessed and postprocessed quantization index modulation methods for digital watermarking. In Proceedings of SPIE Vol. 3971: Security and Watermarking of Multimedia Contents II, pp. 48-59, San Jose, CA, USA, January 2000.
5. Chen B, Wornell GW. Quantization index modulation: a class of provably good methods for digital watermarking and information embedding. IEEE Transactions on Information Theory 2001; 47(4):1423-1443.
6. Brunk H. Quantizer characteristics important for quantization index modulation. In Proceedings of SPIE Vol. 4314: Security and Watermarking of Multimedia Contents III, pp. 686-694, San Jose, CA, USA, January, 2001.
7. Caire G, Shamai (Shitz) S. On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel. IEEE Transactions on Information Theory 2003; 1691-1706.
8. Conway JH, Sloane NJA. Sphere Packings, Lattices and Groups (3rd edn). Springer Verlag: New York, Berlin, 1993.
9. Costa MHM. Writing on dirty paper. IEEE Transactions on Information Theory 1983; 29(3):439-441.
10. Cox I, Kilian J, Leighton T, Shamoon T. Secure Spread Spectrum Watermarking for Multimedia. IEEE Transactions on Image Processing 1997; 6(12):1673-1687.
11. Cox IJ, Miller ML, McKellips AL. Watermarking as communications with side information. In Proceedings of the IEEE, Special Issue on Identification and Protection of Multimedia Information, pp. 1127-1141, July 1999.
12. Cox I, Miller M, Bloom J. Digital Watermarking. Morgan Kaufmann Publishers: San Francisco, 2002.
13. Dixon RC. Spread Spectrum Systems. John Wiley & Sons: New York, 1984.
14. Eggers JJ, Bäuml R, Tzschoppe R, Girod B. Scalar costa scheme for information embedding. IEEE Transactions on Signal Processing, Special Issue on Signal Processing for Data Hiding in Digital Media and Secure Content Delivery 2003; 51(4): 1003-1019.
15. Eggers JJ, Girod B. Informed Watermarking. Kluwer Academic Publishers: Boston, 2002.
16. Eggers JJ, Su JK, Girod B. A blind watermarking scheme based on structured codebooks. In Secure Images and Image Authentication, Proceedings of IEE Colloquium, pp. 4/1-4/6, London, UK, April 2000.
17. Eggers JJ, Su JK, Girod B. Performance of a practical blind watermarking scheme. In Proceedings of SPIE Vol. 4314: Security and Watermarking of Multimedia Contents III, pp. 594-605, San Jose, CA, USA, January 2001.
18. Erez U, Shamai S, Zamir R. Capacity and lattice-strategies for cancelling known interference. In International Symposium on Information Theory and Its Application (ISITA 2000), pp. 681-684, Honolulu, Hawaii, November 2000.
19. Fischer RFH. Precoding and Signal Shaping for Digital Transmission. John Wiley & Sons: New York, 2002.
20. Fischer RFH, Windpassinger C, Lampe A, Huber JB. Space-time transmission using Tomlinson-Harashima Preceding. 4th International ITG Conference on Source and Channel Coding, Berlin, January 2002.
21. Fischer R, Windpassinger C, Lampe A, Huber J. MIMO precoding for decentralized receivers. In International Symposium on Information Theory (ISIT'02), Lausanne, Switzerland, July 2002.
22. Fischer RFH, Windpassinger C, Huber JB. Module-lattice reduction in precoding schemes. In International Symposium on Information Theory (ISIT'03), Yokohama, Japan, June 2003.
23. Forney GD, Wei L-F. Multidimensional Constellations - Part I: introduction, figures of merit, and generalized cross constellations. IEEE Journal on Selected Areas in Communications 1989; JSAC-7(6):877-892.
24. Forney GD, Trott MD, Chung S-Y. Sphere-bound-achieving coset codes and multilevel coset codes. IEEE Transactions on Information Theory 2000; 11-46(3): 820-850.
25. Gel'fand SI, Pinsker MS. Coding for channel with random parameters. Problems of Control and Information Theory 1980; 9(1):19-31.
26. Gray RM, Neuhoff DL. Quantization. IEEE Transactions on Information Theory 1998; IT-44(6):2325-2383.
27. Moulin P, O'Sullivan JA. Information-theoretic analysis of information hiding. IEEE Transactions on Information Theory 2003; 49(3): 563-593.
28. Proakis JG. Digital Communications (4th edn). McGraw-Hill: New York, 2001.
29. Shannon CE. Communication Theory of Secrecy Systems. Bell System Technical Journal 1949; 28:656-715.
30. Zamir R, Shamai (Shitz) S, Erez U. Nested Linear/Lattice Codes for Structured Multiterminal Binning. IEEE Transactions on Information Theory 2002; IT-48(6):1250-1276.