DocumentCode
680136
Title
A new steganographic scheme based on first order Reed Muller codes - A new steganographic scheme
Author
Jouhari, Houda ; Souidi, El Mamoun
Author_Institution
Lab. de Math., Univ. Mohammed V-Agdal, Rabat, Morocco
fYear
2011
fDate
18-21 July 2011
Firstpage
351
Lastpage
356
Abstract
Reed-Muller codes are widely used in communications and they have fast decoding algorithms. In this paper we present an improved data hiding technique based on the first order binary Reed-Muller syndrome coding. The proposed data hiding method can hide the same amount of data as known methods with reduction of time complexity from 2m(2m - 1)2m+1 binary operations to 2m(2m - 1)m binary operations.
Keywords
Boolean functions; Reed-Muller codes; computational complexity; decoding; error correction codes; steganography; 2m(2m-1)2m+1 binary operations; 2m(2m-1)m binary operations; Boolean functions; data hiding technique; error correcting codes; fast decoding algorithms; first order binary Reed-Muller syndrome coding; steganographic scheme; time complexity reduction; Cryptography; Information theory; Lead; Boolean functions; Error correcting codes; Reed-Muller codes R M (1,m); Steganography;
fLanguage
English
Publisher
ieee
Conference_Titel
Security and Cryptography (SECRYPT), 2011 Proceedings of the International Conference on
Conference_Location
Seville
Type
conf
Filename
6732412
Link To Document