Abstract
In this paper, we compare Huffman coding and Arithmetic coding with ASCII coding to observe their contribution to steganography. This way is to compress the embedded information first for enhance the payload of a cover image. There are many wonderful coding methods to compress this kind of string, such as Huffman coding and Arithmetic coding. The experiment results indicate that Huffman coding and Arithmetic coding as an important preprocess step of steganography can effectively reduce the amount of secret information with efficient encoding performance. And a theory opinion related to payload calculation is proposed which can be used to describe the relationship among the three parameters of steganography: imperceptibility, information embedding efficiency and payload.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
