A New Coding Technique and Analysis of Trees
D. A. Angel Sherin1, V. Maheswari2
1D. A. Angel Sherin, Research Scholar, Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies (VISTAS), Chennai (Tamil Nadu), India.
2Dr. V. Maheswari, Associate Professor, Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies (VISTAS), Chennai (Tamil Nadu), India.
Manuscript received on 18 January 2020 | Revised Manuscript received on 01 February 2020 | Manuscript Published on 05 February 2020 | PP: 72-75 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10271284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1027.1284S519
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: One-Time Pad Cipher, Huffman Coding, Trees, Rooted Trees, Huffman Vertex, Edge Labeling and Median. 2010 Mathematical Subject Classification Number: 05C78.
Scope of the Article: Cryptography and Applied Mathematics