R. Anderson and F. Petitcolas, On the limits of steganography, IEEE Journal on Selected Areas in Communications, vol.16, issue.4, pp.474-481, 1998.
DOI : 10.1109/49.668971

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.
DOI : 10.1109/TIT.1978.1055873

J. Bierbrauer, On Crandall's problem, Personal communication, 2001.

J. Bierbrauer and J. Fridrich, Constructing good covering codes for applications in steganography) Transactions on data hiding and multimedia security III, pp.1-22, 2008.

R. P. Brent, S. Gao, and A. G. Lauder, Random Krylov Spaces over Finite Fields, SIAM Journal on Discrete Mathematics, vol.16, issue.2, pp.276-287, 2001.
DOI : 10.1137/S089548010139388X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.9351

C. Cachin, An Information-Theoretic Model for Steganography, Lecture Notes in Computer Science, vol.1525, pp.306-318, 1998.
DOI : 10.1007/3-540-49380-8_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9769

C. Cachin, An information-theoretic model for steganography, Information and Computation, vol.192, issue.1, pp.41-56, 2004.
DOI : 10.1016/j.ic.2004.02.003

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, ) Advances in Cryptology ASIACRYPT 2001, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511

R. Crandall, Some notes on steganography, 1998.

T. Filler and J. Fridrich, Wet ZZW construction for steganography, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS), pp.131-135, 2009.
DOI : 10.1109/WIFS.2009.5386467

T. Filler and J. Fridrich, Minimizing additive distortion functions with non-binary embedding operation in steganography, 2010 IEEE International Workshop on Information Forensics and Security, p.2010, 2010.
DOI : 10.1109/WIFS.2010.5711444

T. Filler, J. Judas, and J. Fridrich, Minimizing additive distortion in steganography unsing syndrome-trellis codes, IEEE Trans. on Information Forensics and Security, 2011.

T. Filler, J. Judas, and J. Fridrich, Minimizing embedding impact in steganography using trellis-coded quantization, IS&T/SPIE International Symposium on Electronic Imaging 2010 -Media Forensics and Security II. Proceedings of the SPIE, 2010.

C. Fontaine and F. Galand, How Can Reed-Solomon Codes Improve Steganographic Schemes?, 9th Information Hiding ? IH'07, pp.130-144, 2007.
DOI : 10.1007/3-540-45496-9_21
URL : https://hal.archives-ouvertes.fr/inria-00504247

C. Fontaine and F. Galand, How Reed-Solomon codes can improve steganographic schemes, EURASIP J. Inf. Secur, pp.1-10, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00504247

J. Fridrich, Asymptotic Behavior of the ZZW Embedding Construction, IEEE Transactions on Information Forensics and Security, vol.4, issue.1, pp.151-153, 2009.
DOI : 10.1109/TIFS.2008.2011082

J. Fridrich and T. Filler, Practical methods for minimizing embedding impact in steganography, Security, Steganography, and Watermarking of Multimedia Contents IX, 2007.
DOI : 10.1117/12.697471
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.641.3687

J. Fridrich, M. Goljan, P. Lisonek, and D. Soukal, Writing on wet paper, IEEE Transactions on Signal Processing, vol.53, issue.10, pp.3923-3935, 2005.
DOI : 10.1109/TSP.2005.855393

J. Fridrich, M. Goljan, and D. Soukal, Wet Paper Codes With Improved Embedding Efficiency, IEEE Transactions on Information Forensics and Security, vol.1, issue.1, pp.102-110, 2006.
DOI : 10.1109/TIFS.2005.863487
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.5982

J. Fridrich and D. Soukal, Matrix Embedding for Large Payloads, IEEE Transactions on Information Forensics and Security, vol.1, issue.3, pp.390-395, 2006.
DOI : 10.1109/TIFS.2006.879281

J. J. Fridrich, M. Goljan, and D. Soukal, Efficient Wet Paper Codes, pp.204-218, 2005.
DOI : 10.1007/11558859_16

F. Galand and G. Kabatiansky, Information hiding by coverings, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), pp.151-154, 2003.
DOI : 10.1109/ITW.2003.1216717

F. Galand and G. Kabatiansky, Coverings, centered codes, and combinatorial steganography, Problems of Information Transmission, vol.45, issue.3, pp.289-297, 2009.
DOI : 10.1134/S0032946009030107

J. Kodovsk´ykodovsk´y, J. Fridrich, and T. Pevn´ypevn´y, Statistically undetectable jpeg steganography: Dead ends, challenges, and opportunities, Proc. of the ACM Multimedia and Security Workshop, pp.3-14, 2007.

A. Mcloughlin, The complexity of computing the covering radius of a code, IEEE Transactions on Information Theory, vol.30, issue.6, pp.800-804, 1984.
DOI : 10.1109/TIT.1984.1056978

C. Munuera and M. Barbier, Wet paper codes and the dual distance in steganography, Advances in Mathematics of Communications, vol.6, issue.3, 2011.
DOI : 10.3934/amc.2012.6.273
URL : https://hal.archives-ouvertes.fr/inria-00584877

O. Medeni, M. Souidi, and E. M. , A steganography schema and error-correcting codes, Journal of Theoretical and Applied Information Technology, vol.18, issue.1, pp.42-47, 2010.

J. Rifà and L. Ronquillo, Product perfect Z2Z4-linear codes in steganography, International Symposium on Information Theory and its Applications -ISITA, p.2010, 2010.

H. Rifà-pous and J. Rifà, Product perfect codes and steganography, Digital Signal Processing, vol.19, issue.4, pp.764-769, 2009.
DOI : 10.1016/j.dsp.2008.11.005

V. Sachnev, H. Kim, and R. Zhang, Less detectable jpeg steganography method based on heuristic optimization and BCH syndrom coding, ACM Multimedia & Se- curity'09, pp.131-139, 2009.

D. Schönfeld and A. Winkler, Embedding with syndrome coding based on BCH codes, Proceeding of the 8th workshop on Multimedia and security , MM&Sec '06, pp.214-223, 2006.
DOI : 10.1145/1161366.1161405

D. Schönfeld and A. Winkler, Reducing the Complexity of Syndrome Coding for Embedding, Proc. of the 10th International Worksop on Information Hiding, pp.145-158, 2007.
DOI : 10.1007/11558859_16

G. Simmons, The Prisoners??? Problem and the Subliminal Channel, Advances in Cryptology ? CRYPTO'83, pp.51-67, 1984.
DOI : 10.1007/978-1-4684-4730-9_5

A. Vardy, The intractability of computing the minimum distance of a code, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1757-1766, 1997.
DOI : 10.1109/18.641542

S. Vladut, D. Nogin, and M. Tsfasman, Algebraic Geometric Codes: Basic Notions (Mathematical Surveys and Monographs), 2007.

A. Westfeld, F5???A Steganographic Algorithm, Lecture Notes in Computer Science, vol.2137, pp.289-302, 2001.
DOI : 10.1007/3-540-45496-9_21

R. Zhang, V. Sachnev, and H. Kim, Fast BCH Syndrome Coding for Steganography, Lecture Notes in Computer Science, vol.33, issue.2, pp.48-58, 2009.
DOI : 10.1007/3-540-45496-9_21

W. Zhang, X. Zhang, and S. Wang, Near-Optimal Codes for Information Embedding in Gray-Scale Signals, IEEE Transactions on Information Theory, vol.56, issue.3, pp.1262-1270, 2010.
DOI : 10.1109/TIT.2009.2039087

W. Zhang, X. Zhang, and S. Wang, Maximizing Steganographic Embedding Efficiency by Combining Hamming Codes and Wet Paper Codes, Proc. of the 10th International Worksop on Information Hiding, pp.60-71, 2008.
DOI : 10.1109/TIT.2003.810639