Novel Compression of Sparse Bit-Strings — Preliminary Report

  • Aviezri S. Fraenkel
  • Shmuel T. Klein
Part of the NATO ASI Series book series (volume 12)


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.


Information Retrieval System Numeration System Digitize Picture Huffman Code Compression Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Choueka Y., The Responsa Project: What, How and Why, 1976–1981, Institute for Inf. Retr. and Comp. Linguistics, Bar-Ilan Univ. (1982).Google Scholar
  2. [2]
    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
  3. [3]
    Fraenkel A.S., Systems of Numeration,Amer. Math. Monthly, to appear.Google Scholar
  4. [4]
    Hunter R. & Robinson A.H., International Digital Facsimile Coding Standards, Proc. IEEE, Vol 68 (1980) 854–867.CrossRefGoogle Scholar
  5. [5]
    Jakobson. M., Huffman coding in bit-vector compression, Information Processing Letters 7 (1978) 304–307.MathSciNetCrossRefGoogle Scholar
  6. [6]
    Knuth. D.E., The Art of Computer Programming, Vol. I, Fundamental Algorithms, Addison-Wesley, Reading, Mass. (1973).Google Scholar
  7. [7]
    Knuth D.E., The Art of Computer Programming, Vol. II, Semi-numerical Algorithms, Addison-Wesley, Reading, Mass. (1973).Google Scholar
  8. [8]
    Ramachandran K., Coding Method for Vector Representation of Engineering Drawings, Proc. IEEE, Vol 68 (1980) 813–817.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Aviezri S. Fraenkel
    • 1
    • 2
  • Shmuel T. Klein
    • 2
  1. 1.Department of Mathematics and StatisticsThe University of CalgaryAlbertaCanada
  2. 2.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations