Four limits in probability and their roles in source coding

Abstract

In information-spectrum methods proposed by Han and Verdú, quantities defined by using the limit superior (or inferior) in probability play crucial roles in many problems in information theory. In this paper, we introduce two nonconventional quantities defined in probabilistic ways. After clarifying basic properties of these quantities, we show that the two quantities have operational meaning in the e-coding problem of a general source in the ordinary and optimistic senses. The two quantities can be used not only for obtaining variations of the strong converse theorem but also establishing upper and lower bounds on the width of the entropyspectrum. We also show that the two quantities are expressed in terms of the smooth Rényi entropy of order zero. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.