Optimal output-uniform coding for a union of different sets of sources


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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.

About the authors

V. K. Trofimov

Siberian State University of Telecommunications and Informatics; Ershov Institute of Informatics Systems, Siberian Branch

Author for correspondence.
Email: trofimov@sibsutis.ru
Russian Federation, ul. Kirova 86, Novosibirsk, 630102; pr. Lavrent’eva 6, Novosibirsk, 630090

T. V. Khramova

Siberian State University of Telecommunications and Informatics

Email: trofimov@sibsutis.ru
Russian Federation, ul. Kirova 86, Novosibirsk, 630102

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Allerton Press, Inc.