Skip to Main Content
This paper treats the problem of compressing binary strings of fixed length into shorter strings of fixed length. Constraints are assumed with respect to the maximum number of ones which can occur in the input binary string and on the memory available for encoding or decoding using table look-up operations. Bounds and coding techniques are presented. There appear to be many applications to the information sciences and especially to memory utilization in digital computers and to information retrieval.
Date of Publication: Jan 1968