Simmons, G.J., The Prisoner’s Problem and the Subliminal Channel, Advances in Cryptology: Proc. CRYPTO’83 (Workshop on Communication Security), D. Chaum, Ed., New York: Plenum, 1984, pp. 51–67.
Cachin, C., An Information-Theoretic Model for Steganography, Proc. 2nd Int. Workshop on Information Hiding, Portland, USA, 1998, Aucsmith, D., Ed., Lect. Notes Comp. Sci., vol. 1525, Berlin: Springer, 1998, pp. 306–318.
Ryabko, B.Ya. and Ryabko, D.B., Asymptotically Optimal Perfect Steganographic Systems, Probl. Peredachi Inf., 2009, vol. 45, no. 2, pp. 119–126 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 2, pp. 184–190].
Bassalygo, L.A. and Pinsker, M.S., Centered Error-Correcting Codes, Probl. Peredachi Inf., 1999, vol. 35, no. 1, pp. 30–37 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 1, pp. 25–31].
Somekh-Baruch, A. and Merhav, N., On the Capacity Game of Private Fingerprinting Systems under Collusion Attacks, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 3, pp. 884–899.
Galand, F. and Kabatiansky, G., Steganography via Covering Codes, in Proc. 2003 IEEE Int. Sympos. on Information Theory (ISIT’03), Yokohama, Japan, pp. 192.
Galand, F. and Kabatiansky, G., Information Hiding by Coverings, in Proc. 2003 IEEE Information Theory Workshop, Paris, France, pp. 151–154.
Galand, F., Practical Construction against Theoretical Approach in Fingerprinting, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT’06), Seattle, USA, pp. 2603–2606.
Cohen, G., Honkala, I., Listyn, S., and Lobstein, A., Covering Codes, Amsterdam: North-Holland, 1997.
Vlăduţ, S.G., Nogin, D.Yu., and Tsfasman, M.A., Algebrogeometricheskie kody. Osnovnye ponyatiya (Algebraic Geometry Codes. Basic Notions), Moscow: MCCME, 2003.