A coding problem in steganography

Designs, Codes, and Cryptography

Volumn 46, Issue 1, 2008, Pages 67-81

  Zhang, Weiming ^a,b   Li, Shiqu ^a  

^a INFORMATION ENGINEERING UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Error correcting codes; Hiding redundancy; Matrix encoding; MLE codes; Perfect codes; Steganography; Stego codes

Indexed keywords

ALGORITHMS; BINARY CODES; CLASSIFICATION (OF INFORMATION); CRYPTOGRAPHY; PROBLEM SOLVING; REDUNDANCY;

ERROR CORRECTING CODES; HIDING REDUNDANCY; MATRIX ENCODING; MAXIMUM LENGTH EMBEDDABLE (MLE) CODE; PERFECT CODES; STEGANOGRAPHIC ALGORITHM; VECTOR SPACE;

ENCODING (SYMBOLS);

EID: 37149022890     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-007-9135-9     Document Type: Article

References (11)

1. Crandall R.: Some notes on steganography. Available: http://os.inf.tu- dresden.de/~westfeld/crandall.pdf (1998). Accessed August 2007
2. Fridrich J., Goljan M. (2004). On estimation of secret message length in LSB steganography in spatial domain. Proceedings of SPIE-Security. Steganography and Watermarking of Multimedia Contents VI 5306, 23-34
3. Fridrich J., Goljan M., Soukal D.: Searching for the stego key. In: Proceedings of SPIE-Security, Steganography and Watermarking of Multimedia Contents VI, Electronic Imaging 5306, 70-82 (2004).
4. Chen Y.Y., Pan H.K., Tseng Y.C.: A secure data hiding scheme for two color images. In IEEE Symposium On Computer and Communications (2000) Available: http://www.csie.nctu.edu.tw/yctseng. Accessed May 2005
5. Tseng Y.C., Pan H.K. (2002). Data hiding in 2-color images. IEEE Trans. Comput. 51(7): 873-890
6. Westfeld A.: F5: a steganographic algorithm, high capacity despite better steganalysis. Proceedings of 4th International Workshop on Information Hiding. LNCS 2137, 289-302 (2001).
7. MacWilliams F.J., Sloane N.J.A. (1977) The theory ofÿ Error-Correcting Codes. North-Holland Publishing Company, Amsterdam
8. Tietäväinen A. (1973). On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24: 88-96
9. Krotov D.S. (2000). Lower bounds on the number of m-quasigroups of order 4 and the number of perfect binary codes. Discrete Anal. Oper. Res. 1(7) 2: 47-53
10. Moulin P., O'Sullivan J.A. (2003). Information theoretic analysis of information hiding. IEEE Trans. Inform Theory, 49(3): 563-593
11. Moulin P., Wang Y.: New results on steganographic capacity. Proceeding of CISS 2004. University of Princeton, Princeton, New Jersey (2004). Available: http://www.ifp.uiuc.edu/~ywang11/paper/CISS04_204.pdf. Accessed August 2007