ENCODING OF MOORE AND MILEY SOURCES BY NON-EQUIVALENT CHARACTERS WITH UNKNOWN MESSAGE STATISTICS
V.K. Trofimov1,2, T.V. Khramova1
1Siberian State University of Telecommunications and Information Science, Novosibirsk, Russia
2A.P. Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Keywords: entropy, encoding, encoding redundancy, message source, capacity
Abstract
The redundancy of universal encoding of Markov sources defined by transition probability matrices with a fixed number of different strings by non-uniform symbols is found. As a corollary, redundancy estimates are obtained for Markov sources with memory s and Markov sources of Miley defined by a graph. The rate of redundancy decreasing is determined depending on the graph characteristics, the encoded block length, and the channel bandwidth.
|
