Key points are not available for this paper at this time.
Algorithms are presented for encoding and decoding strings of characters as real binary fractions, using registers of fixed precision. The encoding is left to right and does not require blocking. The algorithms have storage requirements O (N) and computation time O (n ₂N) for string length n and alphabet size N.
Frank Rubin (Thu,) studied this question.