Novel Compression of Sparse Bit-Strings — Preliminary Report
New methods for the compression of large sparse binary strings are presented. They are based on various new numeration systems in which the lengths of zero-block runs are represented. The basis elements of these systems, together with the non-zero blocks, are assigned Huffman codes. Experiments run on bit-maps of the Responsa Retrieval Project, and for comparison on randomly generated maps and on a digitized picture, yield compressions superior to previously known methods.
Unable to display preview. Download preview PDF.
- Choueka Y., The Responsa Project: What, How and Why, 1976–1981, Institute for Inf. Retr. and Comp. Linguistics, Bar-Ilan Univ. (1982).Google Scholar
- Fraenkel A.S., All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, Expanded Summary, Proc. Third Symp. on Legal Data Processing in Europe, Oslo (1975) 134–141 (Reprinted in Jurimetrics J. 16 (1976) 149–156 and in Informatica e Diritto II, No. 3 (1976) 362–370 ).Google Scholar
- Fraenkel A.S., Systems of Numeration,Amer. Math. Monthly, to appear.Google Scholar
- Knuth. D.E., The Art of Computer Programming, Vol. I, Fundamental Algorithms, Addison-Wesley, Reading, Mass. (1973).Google Scholar
- Knuth D.E., The Art of Computer Programming, Vol. II, Semi-numerical Algorithms, Addison-Wesley, Reading, Mass. (1973).Google Scholar