Abstract
A message is encoded using one-time pad Cipher and Huffman coding with certain algorithm. Encoding process is done using a symmetric key known to sender and receiver. Then we get the encoded message as Ciphertext with a binary tree. Using the binary tree we form a prefix code of Huffman coding and we define a new labeling function of edge and vertex labeling. In this paper, we discuss the two methods of encoding algorithm and investigate Tree, Rooted trees, properties, theorem and Median of Huffman binary tree.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Recent Technology and Engineering
Disclaimer: 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.