Ensuring Message Embedding in Wet Paper Steganography

DOI10.1007/978-3-642-25516-8_15zbMath1291.94050arXiv1111.2301OpenAlexW3099207270MaRDI QIDQ3104699

Daniel Augot, Caroline Fontaine, Morgan Barbier

Publication date: 16 December 2011

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.2301

zbMATH Keywords

steganographysyndrome coding problemwet paper codes

Mathematics Subject Classification ID

Cryptography (94A60) Bounds on codes (94B65)

Cites Work

• Unnamed Item
• Unnamed Item
• An information-theoretic model for steganography
• Coverings, centered codes, and combinatorial steganography
• Wet paper codes and the dual distance in steganography
• Fast BCH Syndrome Coding for Steganography
• The complexity of computing the covering radius of a code
• On the inherent intractability of certain coding problems (Corresp.)
• The intractability of computing the minimum distance of a code
• Random Krylov Spaces over Finite Fields
• Near-Optimal Codes for Information Embedding in Gray-Scale Signals
• Writing on wet paper

This page was built for publication: Ensuring Message Embedding in Wet Paper Steganography