A data compression algorithm that combines the Symbol Ranking, Weighted Frequency Count and Arithmetic Coding algorithms, reaching a compression rate of 2.45 bits per Byte on the Calgary Corpus. The project has been part of the semestral project of the subject "Organización de datos" of the University of Buenos Aires, Faculty of Engineering (first semester of 2014).
The algorithm has been based on the following papers:
- Fenwick, P. (1997). Symbol ranking text compression with Shannon recodings. Journal of Universal Computer Science, 3(2), 70-85.
- Fenwick, P. (1997). A fast, constant-order, symbol ranking text compressor. Department of Computer Science, The University of Auckland, New Zealand.
Compress:
c fileIn
# output file: fileIn.srDecompress:
d fileIn.srPending performance reports (on memory usage and speed) and table charts comparing the compressor with well-known algorithms.