Learn More
In this work, we consider the text data-hiding problem as a particular instance of the well-known Gel'fand-Pinsker problem [1]. The text, where some message m ∈ M is to be hidden, is represented by x and called cover text. Assuming the knowledge of the conditional probability distribution p(u|x), |M||J | codewords u are generated independently at random and(More)
  • 1