A simple general binary source code (Corresp.)
Glen G. Langdon, J. Rissanen · IEEE Transactions on Information Theory · 1982
A source code for binary strings, admitting a simple and fast hardware implementation, is described. The code is an arithmetic code, and it is capable of encoding strings modeled by stationary or nonstationary sources alike without use of alphabet extension. In particular, in the case with a stationary independent information source, the code degenerates to a bitwise implementation of Golomb's run-length code.