Arithmetic stream coding using fixed precision registers

Frank Rubin · IEEE Transactions on Information Theory · 1979

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 requirementsO(N)and computation timeO(n \log_{2}N)for string lengthnand alphabet sizeN.

Read the paper · More papers on PaperTik