Graph realization of reed-muller codes for data hiding

In recent years the information industry develops vigorously and the progress in technology results in thriving augmentation of internet and people pass messages mutually through network in large number and triggers the issue of information security. In order to protect the safety and reliability of message passing, the development of steganography is thereby generated. In this research we will aim at its embedding and the major point of investigation is how to ensure the quality of the host after embedding secret message that means how to lower its distortion. On the other hand we want to increase the embedding efficiency and in this way we can send much more messages. At the same time we also have to consider the problem of complexity as too complicated algorithm is not feasible. This thesis is data hiding of binary host image and the Reed-Muller Codes of linear block codes in the error-correcting codes is applied to conduct research on steganography. Decoding algorithm is presented to conduct simulation analysis and discussion aiming at the embedding rate and embedding efficiency.