There is a difference between the optimal rates of fixed-length source coding and intrinsic
randomness when we care about the second-order asymptotics. We prove this difference for …

This paper introduces the notions of variable-to-fixed and fixed-to-variable channel capacity,
without feedback. For channels that satisfy the strong converse, these notions coincide with …

We investigate the computation of Csisza/spl acute/r's bounds for the joint source-channel
coding (JSCC) error exponent E/sub J/of a communication system consisting of a discrete …

We study the performance limits of state-dependent discrete memoryless channels with a
discrete state available at both the encoder and the decoder. We establish the ε-capacity as …

New channel coding converse and achievability bounds are derived for a single use of an
arbitrary channel. Both bounds are expressed using a quantity called the ldquosmooth 0 …

This paper establishes a new unified method for fixed-length source coding problems of
general sources. Specifically, we introduce an alternative definition of the smooth Renyi …

This paper deals with two typical random number generation problems in information theory.
One is the source resolvability problem (resolvability problem for short) and the other is the …

Two typical fixed-length random number generation problems in information theory are
considered for general sources. One is the source resolvability problem and the other is the …

We consider block codes for degraded wiretap channels in which the legitimate receiver
decodes the message with an asymptotic error probability no larger than ε but the leakage to …

The “bee-identification problem” was formally defined by Tandon, Tan and Varshney [IEEE
Trans. Commun., vol. 67, 2019], and the error exponent was studied. This work extends the …