A boundless compression algorithm in APL2

ABSTRACT

Compression algorithms are very useful for a variety of applications. Originally, their main use was what their name suggests, reducing the size of computer files without losing any information. It was interesting to see that they were equally useful for all types of files, such as text, bit maps, many types of images, sound, scientific experimental data, computer code (source and object code), combined data (text and images, for instance), and so on, and so forth. Only when the files have been coded with an imbedded compression algorithm (as happens in some image formats, such as JPEG, or in sound renditions in MP3) the additional compression by generalized algorithms is negligible.

REFERENCES

• 1: Timothy C. Bell , John G. Cleary , Ian H. Witten, Text compression, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
• 2: M. Burrows, D. J .Wheeler, A Block Sorting Lossless Data Compression Algorithm, Research Center of Digital Equipment Corporation, Technical Report 124, Palo Alto, Calif. 1994.
• 3: D. Huffman, A Method for the Construction of Minimum Redundancy Codes, Proc. IRE, Vol. 40:9, 1952.
• 4: M. Alfonseca, M. Cebrián, A. Ortega, Evolving Computer-generated Music by Means of the Normalized Compression Distance, WSEAS Transactions on Information Science and Applications, Vol. 9:2, p. 1367--1372, Sep. 2005.
• 5: M. Cebrián, M. Alfonseca, A. Ortega, Common Pitfalls using the Normalized Compression Distance: to Watch out for in a Compressor, submitted to Communications in Information and Systems.
• 6: J. Ziv, A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans. On Information Theory, 23:3, p. 337--343, 1977.
• 7: A. Ortega , A. Dalhoum , M. Alfonseca, Grammatical evolution to design fractal curves with a given dimension, IBM Journal of Research and Development, v.47 n.4, p.483-493, July 2003