Economical encoding of commas between strings

Authors:
S. Even;M. Rodeh
Affiliations:
Israel Institute of Technology, Haifa, Israel;IBM Israel Scientific Center, Haifa, Israel
Venue:
Communications of the ACM
Year:
1978

Citing 0
Cited 6

Data compression with finite windows

Communications of the ACM
Overflow/Underflow-Free Floating-Point Number Representations with Self-Delimiting Variable-Length Exponent Field

IEEE Transactions on Computers - Special issue on computer arithmetic
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
SASE: implementation of a compressed text search engine

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Data compression procedures utilizing the similarity of data

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Integer representation in the mixed base (2,3)

Cybernetics and Systems Analysis

Quantified Score

Hi-index	48.23

Visualization

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.