Information embedding with reversible stegotext

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2728-2732

  Sumszyk, Oma ^a   Steinberg, Yossef ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Arimoto blahut algorithm; Information embedding; State dependent channels; Stegotext reversibility

Indexed keywords

ACHIEVABLE RATE; ARIMOTO-BLAHUT ALGORITHM; HOST SIGNALS; INFORMATION EMBEDDING; ITERATIVE ALGORITHM; NOISY CHANNEL; STATE DEPENDENT CHANNELS; STEGOTEXT REVERSIBILITY;

INFORMATION THEORY;

DECODING;

EID: 70449492958     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205855     Document Type: Conference Paper

References (13)

1. S. Arimoto, "An algorithm for calculating the capacity of an arbitrary discrete memoryless channel," IEEE Trans. Inform. Theory, vol. IT-18, no. 1, pp. 14-20, Jan. 1972.
2. R.J. Barron, B. Chen and G.W. Wornell, "The duality between information embedding and source coding with side information and some applications," IEEE Trans. Inform. Theory, vol. 49, no. 5, pp. 1159-1180, May 2003.
3. R. Blahut, "Computation of channel capacity and rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-18, no. 4, pp. 460--472, Jul. 1972.
4. S. Cheng, V. Stankovic and Z. Xiong, "Computing the channel capacity and rate-distortion function with two-sided state information," IEEE Trans. Inform. Theory, vol. 51, no. 12, pp. 4418--4425, Dec. 2005.
5. M.H.M. Costa, "Writing on dirty paper," IEEE Trans. Inform. Theory, vol. IT-29, pp.439--441, May 1983.
6. F Dupuis, W. Yu and F Willems, "Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information," Proc. IEEE Int. Symp. Information Theory, Chicago, USA, p. 179, Jul. 2004.
7. S.I. Gelfand and M.S. Pinsker, "Coding for channel with random parameters," Probl. Contr. Inform. Theory, vol. 9, no. 1, pp. 19-31, 1980.
8. C. Heegard and A. A. EI Gamal, "On the capacity of computer memory with defects," IEEE Trans. Inform. Theory, voI.IT-29, no. 6, pp. 731-739, Sep. 1983.
9. T. Kalker and FM.J. Willems, "Capacity bounds and constructions for reversible data-hiding," Proc. of the 14th International Conference On Digital Signal Processing, Santorini, Greece, vol. 1, pp. 71-76, July 1-3, 2002.
10. S. Kotagiri and J.N. Laneman, "Reversible information embedding in multi-user channels," Proc. of the 43rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, pp. 464473, September 28-30, 2005.
11. P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 563593, Mar. 2003.
12. Y. Steinberg, "Reversible information embedding with compressed host at the decoder," IEEE Int. Symp. Information Theory 2006, Seattle, USA, July 9-14, 2006.
13. R. W. Yeung, A First Course in Information Theory, New York: Kluwer Academic/Plenum, 2002.