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
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Modified matrix encoding technique for minimal distortion steganography
IH'06 Proceedings of the 8th 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
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
| 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 [FGLS05] which allow to lock positions that cannot be modified. Recently, BCH codes have been investigated, and seem to be good candidates in this context [SW06]. Here, we show that Reed-Solomon codes are twice better with respect to the number of locked positions and that, in fact, they are optimal. We propose two methods for managing these codes in this context: the first one is based on a naive decoding process through Lagrange interpolation; the second one, more efficient, is based on list decoding techniques and provides an adaptive trade-off between the number of locked positions and the embedding efficiency.