How Reed-Solomon codes can improve steganographic schemes. (English)
EURASIP J. Inf. Secur. 2009, Article ID 274845, 10 p. (2009).
1
Coverings, centered codes, and combinatorial steganography. (English)
Probl. Inf. Transm. 45, No. 3, 289-294 (2009); translation from Probl. Peredachi Inf. 45, No. 3, 106-111 (2009).
2
How Reed-Solomon codes can improve steganographic schemes (English)
EURASIP J. Information Security 2009 (2009).
3
How can Reed-Solomon codes improve steganographic schemes? (English)
Furon, Teddy (ed.) et al., Information hiding. 9th international workshop, IH 2007, Saint Malo, France, June 11‒13, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-77369-6/pbk). Lecture Notes in Computer Science 4567, 130-144 (2008).
4
A survey of homomorphic encryption for nonspecialists. (English)
EURASIP J. Inf. Secur. 2007, Article ID 13801, 10 p. (2007).
5
A survey of homomorphic encryption for nonspecialists (English)
EURASIP J. Information Security 2007 (2007).
6
How can Reed-Solomon codes improve steganographic schemes? (English)
Information Hiding, 130-144 (2007).
7
On the minimum distance of some families of ${\bbfZ}_{2^k}$-linear codes. (English)
Fossorier, Marc (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 15th international symposium, AAECC-15, Toulouse, France, May 12-16, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2643, 235-243 (2003).
8
On the minimum distance of some families of $Z_{2^{k}}$-linear codes (English)
AAECC, 235-243 (2003).
9
Start
Contact
Print
General Help
