Economical encoding of commas between strings

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

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

Index Terms

• Information systems

  • Data management systems

    • Data structures

      • Data layout

        • Data compression

• Software and its engineering

  • Software notations and tools

    • General programming languages

      • Language features

        • Data types and structures