Abstract:
An algorithm of weighting universal coding of $M$-ary sources $(M\geq 2)$ with contexts of variable length is proposed. The estimates of its basic characteristics are derived. A modification of the algorithm is considered, which allows one to adapt to an unknown number of letters generated in each state.
Fulltext:
PDF file (1639 kB)