Share This Author
A new achievable rate region for the interference channel
A new achievable rate region for the general interference channel which extends previous results is presented and evaluated and the capacity of a class of Gaussian interference channels is established.
A general formula for channel capacity
A formula for the capacity of arbitrary single-user channels without feedback is proved and capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate defined as the liminf in probability of the normalized information density.
Approximation Theory of Output Statistics
- T. Han, S. Verdú
- Computer Science, MathematicsProceedings. IEEE International Symposium on…
- 1 May 1993
The notion of resolvability of a channel is introduced, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output statistics for any given input process, and a general formula is obtained which holds regardless of the channel memory structure.
Hypothesis testing with multiterminal data compression
- T. Han
- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1 November 1987
The compact solution is established to the complete data compression cases, which are useful in statistics from the practical point of view and tighter than that of Ahlswede and Csiszar.
Nonnegative Entropy Measures of Multivariate Symmetric Correlations
- T. Han
- Computer ScienceInf. Control.
- 1 February 1978
On source coding with side information via a multiple-access channel and related problems in multi-user information theory
A coding theorem is introduced and established for another type of source-channel matching problem, i.e., a system of source coding with side information via a MAC, which can be regarded as an extension of the Ahlswede-Korner-Wyner type noiseless coding system.
Interval algorithm for random number generation
An efficient and very simple algorithm based on the successive refinement of partitions of the unit interval (0, 1), which is called the interval algorithm, is proposed and a fairly tight evaluation on the efficiency is given.
A unified achievable rate region for a general class of multiterminal source coding systems
A unified treatment of a large class of multiterminal noiseless source coding problems including all previously studied situations is presented. A unified achievable rate region is established for…
Error bound of hypothesis testing with data compression
- H. Shimokawa, T. Han, S. Amari
- Computer ScienceProceedings of IEEE International Symposium on…
- 27 June 1994
A lower bound on the exponent of hypothesis testing error which is better than the bounds which have been previously derived is given, and the sufficient rate for achieving Stein's lemma is given.
Multiple Mutual Informations and Multiple Interactions in Frequency Data
- T. Han
- MathematicsInf. Control.
- 1 July 1980