An Alternative Approach to Compress Text Files Using Fibonacci Sequence and Lucas Series

Abstract

Data compression uses variable-length codes in which symbols that appear frequently are assigned with a specific code pattern (i.e. integer/alphanumeric). The ultimate goal behind assigning the characters with these code patterns is to facilitate easier compression and decompression. After concluding lots of research on different lossless text data compression techniques (i.e. Huffman coding, LZW coding, Shannon–Fano coding) along with the study of various concept of sequence and series (i.e. Fibonacci sequence (Bhattacharyya in complexity analysis of a lossless data compression algorithm using Fibonacci sequence. University of Calcutta, Kolkata, West Bengal (Bhattacharyya in Complexity analysis of a lossless data compression algorithm using Fibonacci sequence. Research Associate Department of Computer Science. University of Calcutta, Kolkata, West Bengal [3]) and Lucas Series), we have given an alternative approach through this research paper to improve the data compression ratio for the text file.