湿纸码与隐写术中的对偶距离
Wet paper codes and the dual distance in steganography
摘要：
1998年，Crandall引入了一种基于编码理论的方法，将信息秘密地嵌入到数字载体（如图像）中。后来，Fridrich等人改进了这种方法，以最大限度地减少嵌入引起的失真;这一过程称为湿纸。然而，如先前在文献中强调的，该方法在包埋步骤期间可能失败。通过研究线性码的对偶距离，我们找到了保证嵌入成功的充分必要条件。由于这些结果本质上是组合性质的，它们可以推广到系统码，一个包含所有线性码的大家族。我们还计算了解的确切个数，并指出了湿纸码与正交表之间的关系。
英文摘要：
In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a large family containing all linear codes. We also compute the exact number of solutions and point out the relationship between wet paper codes and orthogonal arrays.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
