A Survey of Compression Techniques
Sashikala1, Melwin .Y.2, Arunodhayan Sam Solomon3, M.N.Nachappat4
1Prof. Sashikala, Department Of Computer Science, St. Joseph’s College (Autonomous), Bangalore (Karnataka), India.
2Prof. Melwin .Y., Department Of Computer Science, St. Joseph’s College (Autonomous), Langford Road, Shanthinagar, Bangalore – 560027, India.
3Prof. Arunodhayan Sam Solomon, Department Of Computer Science, St. Joseph’s College (Autonomous), Bangalore (Karnataka), India.
4Prof. M.N. Nachappa, Department Of Computer Science, St. Joseph’s College (Autonomous), Bangalore (Karnataka), India.
Manuscript received on 21 March 2013 | Revised Manuscript received on 28 March 2013 | Manuscript published on 30 March 2013 | PP: 152-156 | Volume-2 Issue-1, March 2013 | Retrieval Number: A0543032113/2013©BEIESP
Open Access | Ethics and 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: Digital data is owned, used and enjoyed by many people all over the world. Compressing data is mostly done when we face with problems of constraints in memory. In this paper we have attempted to discuss in general about compression and decompression, the different techniques of compression using ‘Lossless method compression and decompression’ on text data using a simple coding technique called Huffmann coding.
Keywords: Lossless Text Data Compression, Huffman Coding.
Scope of the Article: Data Analytics