Abstract
A method of optimal output-uniform coding for a set of sources consisting of a union of a countable number of sets of sources is proposed. It is shown that the coding is asymptotically optimal for a union of finite-memory Markov sources. It is found that the proposed coding is weakly universal for a set of stationary sources.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have