Reducing the Complexity of Embedding by Applying the Reed Muller Codes
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 2^m(2^m-1)2^{m+1} binary operations to 2^m (2^m -1) m binary operations.
Keywords: Steganography, Error correcting codes, Reed-Muller codes RM(1,m), Boolean functions
Download Full-Text
ABOUT THE AUTHORS
Houda Jouhari
Laboratory of mathematics, informatics and applications, University Mohammed V-Agdal, Faculty of Sciences, Rabat Morocco.
Houda Jouhari
Laboratory of mathematics, informatics and applications, University Mohammed V-Agdal, Faculty of Sciences, Rabat Morocco.
