Twice-universal coding
type: Item
instance of: scholarly article
title: Twice-universal coding
zbMATH Open document ID: 0565.94012
published in: Problems of Information Transmission
publication date: 1984-01-01T00:00:00Z
review text: It is proved that there exists the twice-universal code W. This means that redundancy of W converges to zero assuming unknown statistical characteristics and unknown memory of source. This code has the following features: 1) for each \(\Omega_ i\), the redundancy of W converges asymptotically to the redundancy of the optimum code on \(\Omega_ i\), 2) if there exists a strongly universal code on a set \(\Omega \subset \Omega_{\infty}\), W will be a strongly universal code, 3) W is weakly universal on \(\Omega_{\infty}\), where \(\Omega_ i\) is a finite set of sources, whereas \(\Omega_{\infty}\) is the set of all sources.
Mathematics Subject Classification ID: 94A24
Mathematics Subject Classification ID: 62B10
zbMATH DE Number: 3902546
zbMATH Keywords: weakly universal code
zbMATH Keywords: entropy
zbMATH Keywords: twice-universal code
zbMATH Keywords: redundancy
zbMATH Keywords: optimum code
zbMATH Keywords: strongly universal code
author: B. Ya. Ryabko
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3902546