Abstract
A new universal data compression algorithm is described. This algorithm encodes L source symbols at a time. For the class of binary stationary sources, its rate does not exceed [formula omitted] [formula omitted] bits per source symbol. In our analysis, a property of repetition times turns out to be of crucial importance.
Original language | English |
---|---|
Pages (from-to) | 54-58 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 35 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 1989 |