Economical encoding of commas between strings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Economical encoding of commas between strings

Full text

Pdf (261 KB)

Source

Communications of the ACM archive
Volume 21 , Issue 4 (April 1978) table of contents

Pages: 315 - 317

Year of Publication: 1978

ISSN:0001-0782

Authors

S. Even	Israel Institute of Technology, Haifa, Israel
M. Rodeh	IBM Israel Scientific Center, Haifa, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 14, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/359460.359480 What is a DOI?

ABSTRACT

A method for insertion of delimiters between strings without using new symbols is presented. As the lengths of the strings increase, the extra cost, in terms of prolongation, becomes vanishingly small compared to the lengths of the strings.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bentley, J. L., and Yao, A.C. An almost optical algorithm for unbounded searching. Inform. Processing Letters 5 (1976), 82-87.
	2	Elias, P. Universal codeword sets and representations of the integers. IEEE Trans. Inform. Theory 21,2 (March 1975), 194- 203.
	3	Levenshtein, V.E. On the redundancy and delay of separable codes for the natural numbers. Problems of Cybernetics 20 (1968), 173-179.

CITED BY 6

	E. R. Fiala , D. H. Greene, Data compression with finite windows, Communications of the ACM, v.32 n.4, p.490-505, April 1989
	Michael Rodeh , Vaughan R. Pratt , Shimon Even, Linear Algorithm for Data Compression via String Matching, Journal of the ACM (JACM), v.28 n.1, p.16-24, Jan. 1981
	Hidetoshi Yokoo, Overflow/Underflow-Free Floating-Point Number Representations with Self-Delimiting Variable-Length Exponent Field, IEEE Transactions on Computers, v.41 n.8, p.1033-1039, August 1992
	Srinidhi Varadarajan , Tzi-cker Chiueh, SASE: implementation of a compressed text search engine, Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems, p.23-23, December 08-11, 1997, Monterey, California
	Yahiko Kambayashi , Narao Nakatsu , Shuzo Yajima, Data compression procedures utilizing the similarity of data, Proceedings of the May 4-7, 1981, national computer conference, May 04-07, 1981, Chicago, Illinois
	A. V. Anisimov, Integer representation in the mixed base (2,3), Cybernetics and Systems Analysis, v.45 n.4, p.503-516, July 2009