Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Steganography Preserving Statistical Properties
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Modern Computer Algebra
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Modified matrix encoding technique for minimal distortion steganography
IH'06 Proceedings of the 8th international conference on Information hiding
Reducing the complexity of syndrome coding for embedding
IH'07 Proceedings of the 9th international conference on Information hiding
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
Exploiting preserved statistics for steganalysis
IH'04 Proceedings of the 6th international conference on Information Hiding
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Grid Colorings in Steganography
IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Self-synchronising image steganography algorithms based on error-correcting codes
International Journal of Electronic Security and Digital Forensics
| Hi-index | 0.00 |
The use of syndrome coding in steganographic schemes tends to reduce distortion during embedding. The more complete model comes from the wet papers (J. Fridrich et al., 2005) and allow to lock positions which cannot be modified. Recently, binary BCH codes have been investigated and seem to be good candidates in this context (D. Schönfeld and A. Winkler, 2006). Here, we show that Reed-Solomon codes are twice better with respect to the number of locked positions; in fact, they are optimal. First, a simple and efficient scheme based on Lagrange interpolation is provided to achieve the optimal number of locked positions. We also consider a new andmore general problem, mixing wet papers (locked positions) and simple syndrome coding (low number of changes) in order to face not only passive but also active wardens. Using list decoding techniques, we propose an efficient algorithm that enables an adaptive tradeoff between the number of locked positions and the number of changes.