Open AccessA New Coding Technique and Analysis of Trees
Author(s) -
D. A. Angel Sherin,
V. Maheswari,
M. Ashok Kumar,
V. Mathivanan,
Arthimetic Gottshall,
J. Kahn,
C. Sunitha,
Ricardo Santos David,
Arun Subramanian
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1027.1284s519
Subject(s) - huffman coding , communication source , canonical huffman code , binary tree , computer science , shannon–fano coding , tunstall coding , theoretical computer science , algorithm , ciphertext , encoding (memory) , coding (social sciences) , tree (set theory) , mathematics , combinatorics , data compression , encryption , decoding methods , computer network , artificial intelligence , low density parity check code , statistics , systematic code
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.