On error-correcting codes for a steganography channel

Abstract

A steganography channel is a method of transmitting hidden data by embedding it into another document in a way that is difficult to detect. In this paper, we analyze a model of data-hiding for communication via noiseless steganography channel by application of error-correcting codes. Two corresponding Shannon theorems are proved, and the average covering radius of a code is discussed as an important parameter for steganography applications. The Shannon theorems generalize the results obtained in D'yachkov (2006) for the binary model.