default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTe Sun Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j51]Hideki Yagi
, Te Sun Han:
Variable-Length Resolvability for General Sources and Channels. Entropy 25(10): 1466 (2023)- 2021
- [j50]Te Sun Han, Masahide Sasaki:
Wiretap Channels With Causal and Non-Causal State Information: Revisited. IEEE Trans. Inf. Theory 67(9): 6122-6139 (2021) - 2020
- [j49]Shun Watanabe, Te Sun Han:
Interval Algorithm for Random Number Generation: Information Spectrum Approach. IEEE Trans. Inf. Theory 66(3): 1691-1701 (2020) - [c10]Shun Watanabe, Te Sun Han:
Isomorphism Problem Revisited: Information Spectrum Approach. ISIT 2020: 2332-2336 - [i16]Te Sun Han, Masahide Sasaki:
Wiretap channels with causal state information: revisited. CoRR abs/2001.03482 (2020) - [i15]Shun Watanabe, Te Sun Han:
Isomorphism Problem Revisited: Information Spectrum Approach. CoRR abs/2001.04113 (2020)
2010 – 2019
- 2019
- [j48]Te Sun Han, Masahide Sasaki:
Wiretap Channels With Causal State Information: Strong Secrecy. IEEE Trans. Inf. Theory 65(10): 6750-6765 (2019) - [c9]Shun Watanabe, Te Sun Han:
Interval Algorithm for Random Number Generation: Information Spectrum Approach. ITW 2019: 1-5 - [i14]Shun Watanabe, Te Sun Han:
Interval Algorithm for Random Number Generation: Information Spectrum Approach. CoRR abs/1904.09782 (2019) - 2018
- [j47]Te Sun Han, Ryo Nomura:
First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources. Entropy 20(3): 174 (2018) - [j46]Te Sun Han, Hiroyuki Endo, Masahide Sasaki:
Wiretap Channels With One-Time State Information: Strong Secrecy. IEEE Trans. Inf. Forensics Secur. 13(1): 224-236 (2018) - [c8]Hideki Yagi, Te Sun Han:
Variable-Length Channel Resolvability for Discrete Memoryless Sources and Channels. ISIT 2018: 2047-2051 - [c7]Hideki Yagi, Te Sun Han:
Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding. ISIT 2018: 2391-2395 - [i13]Hideki Yagi, Te Sun Han:
Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding. CoRR abs/1801.04439 (2018) - 2017
- [c6]Te Sun Han, Ryo Nomura:
First- and second-order hypothesis testing for mixed memoryless sources with general mixture. ISIT 2017: 126-130 - [c5]Hideki Yagi, Te Sun Han:
Variable-length resolvability for general sources. ISIT 2017: 1748-1752 - [i12]Hideki Yagi, Te Sun Han:
Variable-Length Resolvability for General Sources and Channels. CoRR abs/1701.08712 (2017) - [i11]Te Sun Han, Ryo Nomura:
First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources with General Mixture. CoRR abs/1703.06279 (2017) - [i10]Te Sun Han, Masahide Sasaki:
Wiretap Channels with Causal State Information: Strong Secrecy. CoRR abs/1708.00422 (2017) - 2016
- [j45]Hiroyuki Endo, Te Sun Han, Masahide Sasaki:
Error and Secrecy Exponents for Wiretap Channels under Two-Fold Cost Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2136-2146 (2016) - [j44]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture. IEEE Trans. Inf. Theory 62(8): 4395-4412 (2016) - 2015
- [c4]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and second-order coding theorems for mixed memoryless channels with general mixture. ISIT 2015: 2969-2973 - [i9]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture. CoRR abs/1501.05887 (2015) - [i8]Hiroyuki Endo, Te Sun Han, Takao Aoki, Masahide Sasaki:
Numerical Study on Secrecy Capacity and Code Length Dependence of the Performances in Optical Wiretap Channels. CoRR abs/1509.04006 (2015) - 2014
- [j43]Ryo Nomura, Te Sun Han:
Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources. IEEE Trans. Inf. Theory 60(9): 5553-5572 (2014) - [j42]Te Sun Han, Hiroyuki Endo, Masahide Sasaki:
Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint. IEEE Trans. Inf. Theory 60(11): 6819-6843 (2014) - 2013
- [j41]Ryo Nomura, Te Sun Han:
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach. IEEE Trans. Inf. Theory 59(1): 1-16 (2013) - [c3]Ryo Nomura, Te Sun Han:
Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources. ISIT 2013: 1974-1978 - [i7]Te Sun Han, Hiroyuki Endo, Masahide Sasaki:
Reliability and Security Functions of the Wiretap Channel under Cost Constraint. CoRR abs/1307.0608 (2013) - 2012
- [c2]Ryo Nomura, Te Sun Han:
Second-order achievable rates in random number generation for mixed sources. ISIT 2012: 816-820 - [i6]Ryo Nomura, Te Sun Han:
Second-Order Slepian-Wolf Source Coding for Mixed Sources. CoRR abs/1207.2505 (2012) - 2011
- [j40]Te Sun Han:
Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network. IEEE Trans. Inf. Theory 57(1): 4-13 (2011) - [i5]Ryo Nomura, Te Sun Han:
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources. CoRR abs/1106.1879 (2011) - 2010
- [c1]Te Sun Han:
Polymatroids with network coding. ITA 2010: 161-172 - [i4]Te Sun Han:
Polymatroids with Network Coding. CoRR abs/1004.1564 (2010)
2000 – 2009
- 2009
- [i3]Te Sun Han:
Multicasting of correlated multisource to multisink over a network. CoRR abs/0901.0608 (2009) - 2007
- [i2]Te Sun Han:
Joint Source-Channel Coding Revisited: Information-Spectrum Approach. CoRR abs/0712.2959 (2007) - 2006
- [i1]Te Sun Han:
An information-spectrum approach to large deviation theorems. CoRR abs/cs/0606104 (2006) - 2005
- [j39]Te Sun Han:
Folklore in source coding: information-spectrum approach. IEEE Trans. Inf. Theory 51(2): 747-753 (2005) - 2001
- [j38]Mamoru Hoshi, Te Sun Han:
Interval algorithm for homophonic coding. IEEE Trans. Inf. Theory 47(3): 1021-1031 (2001) - 2000
- [j37]Te Sun Han, Osamu Uchida:
Source code with cost as a nonuniform random number generator. IEEE Trans. Inf. Theory 46(2): 712-717 (2000) - [j36]Te Sun Han:
Weak variable-length source coding. IEEE Trans. Inf. Theory 46(4): 1217-1226 (2000) - [j35]Te Sun Han:
Theorems on the variable-length intrinsic randomness. IEEE Trans. Inf. Theory 46(6): 2108-2116 (2000) - [j34]Te Sun Han:
The reliability functions of the general source with fixed-length coding. IEEE Trans. Inf. Theory 46(6): 2117-2132 (2000) - [j33]Te Sun Han:
Hypothesis testing with the general source. IEEE Trans. Inf. Theory 46(7): 2415-2427 (2000)
1990 – 1999
- 1999
- [j32]Te Sun Han, Mitsuru Hamada:
Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures. IEEE Trans. Inf. Theory 45(2): 756-760 (1999) - 1998
- [j31]Te Sun Han, Shun-ichi Amari:
Statistical Inference Under Multiterminal Data Compression. IEEE Trans. Inf. Theory 44(6): 2300-2324 (1998) - [j30]Te Sun Han:
An Information-Spectrum Approach to Capacity Theorems for the General Multiple-Access Channel. IEEE Trans. Inf. Theory 44(7): 2773-2795 (1998) - 1997
- [j29]Te Sun Han, Mamoru Hoshi:
Interval algorithm for random number generation. IEEE Trans. Inf. Theory 43(2): 599-611 (1997) - [j28]Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi:
Universal coding of integers and unbounded search trees. IEEE Trans. Inf. Theory 43(2): 669-682 (1997) - [j27]Sergio Verdú, Te Sun Han:
The role of the asymptotic equipartition property in noiseless source coding. IEEE Trans. Inf. Theory 43(3): 847-857 (1997) - [j26]Te Sun Han:
An information-spectrum approach to source coding theorems with a fidelity criterion. IEEE Trans. Inf. Theory 43(4): 1145-1164 (1997) - 1996
- [j25]Akiko Kato, Te Sun Han, Hiroshi Nagaoka:
Huffman coding with an infinite alphabet. IEEE Trans. Inf. Theory 42(3): 977-984 (1996) - 1995
- [j24]Te Sun Han, Shun-ichi Amari:
Parameter estimation with multiterminal data compression. IEEE Trans. Inf. Theory 41(6): 1802-1833 (1995) - [j23]Fumio Kanaya, Te Sun Han:
The asymptotics of posterior entropy and error probability for Bayesian estimation. IEEE Trans. Inf. Theory 41(6): 1988-1992 (1995) - 1994
- [j22]Sergio Verdú, Te Sun Han:
A general formula for channel capacity. IEEE Trans. Inf. Theory 40(4): 1147-1157 (1994) - [j21]Te Sun Han, Sergio Verdú:
Generalizing the Fano inequality. IEEE Trans. Inf. Theory 40(4): 1247-1251 (1994) - [j20]Yasutada Oohama, Te Sun Han:
Universal coding for the Slepian-Wolf data compression system and the strong converse theorem. IEEE Trans. Inf. Theory 40(6): 1908-1919 (1994) - 1993
- [j19]Te Sun Han, Sergio Verdú:
Approximation theory of output statistics. IEEE Trans. Inf. Theory 39(3): 752-772 (1993) - 1992
- [j18]Te Sun Han, Sergio Verdú:
New results in the theory of identification via channels. IEEE Trans. Inf. Theory 38(1): 14-25 (1992) - 1991
- [j17]Te Sun Han, Hajime Sato:
Feedback codes with uniformly bounded codeword lengths and zero-error capacities. IEEE Trans. Inf. Theory 37(3): 655-660 (1991)
1980 – 1989
- 1989
- [j16]Te Sun Han, Kingo Kobayashi:
Exponential-type error probabilities for multiterminal hypothesis testing. IEEE Trans. Inf. Theory 35(1): 2-14 (1989) - [j15]Te Sun Han, Kingo Kobayashi:
The strong converse theorem for hypothesis testing. IEEE Trans. Inf. Theory 35(1): 178-180 (1989) - [j14]Shun-ichi Amari, Te Sun Han:
Statistical inference under multiterminal rate restrictions: A differential geometric approach. IEEE Trans. Inf. Theory 35(2): 217-227 (1989) - 1987
- [j13]Te Sun Han, Kingo Kobayashi:
A dichotomy of functions F(X, Y) of correlated sources (X, Y). IEEE Trans. Inf. Theory 33(1): 69-76 (1987) - [j12]Te Sun Han, Max H. M. Costa:
Broadcast channels with arbitrarily correlated sources. IEEE Trans. Inf. Theory 33(5): 641-650 (1987) - [j11]Te Sun Han:
Hypothesis testing with multiterminal data compression. IEEE Trans. Inf. Theory 33(6): 759-772 (1987) - 1984
- [j10]Te Sun Han:
A general coding scheme for the two-way channel. IEEE Trans. Inf. Theory 30(1): 35-43 (1984) - 1983
- [j9]Rudolf Ahlswede, Te Sun Han:
On source coding with side information via a multiple-access channel and related problems in multi-user information theory. IEEE Trans. Inf. Theory 29(3): 396-411 (1983) - 1981
- [j8]Te Sun Han, Kingo Kobayashi:
A new achievable rate region for the interference channel. IEEE Trans. Inf. Theory 27(1): 49-60 (1981) - [j7]Te Sun Han:
The capacity region for the deterministic broadcast channel with a common message. IEEE Trans. Inf. Theory 27(1): 122-125 (1981) - 1980
- [j6]Te Sun Han:
Multiple Mutual Informations and Multiple Interactions in Frequency Data. Inf. Control. 46(1): 26-45 (1980) - [j5]Te Sun Han:
Slepian-Wolf-Cover Theorem for Networks of Channels. Inf. Control. 47(1): 67-83 (1980) - [j4]Te Sun Han, Kingo Kobayashi:
A unified achievable rate region for a general class of multiterminal source coding systems. IEEE Trans. Inf. Theory 26(3): 277-288 (1980)
1970 – 1979
- 1979
- [j3]Te Sun Han:
The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources. Inf. Control. 40(1): 37-60 (1979) - 1978
- [j2]Te Sun Han:
Nonnegative Entropy Measures of Multivariate Symmetric Correlations. Inf. Control. 36(2): 133-156 (1978) - 1975
- [j1]Te Sun Han:
Linear Dependence Structure of the Entropy Space. Inf. Control. 29(4): 337-368 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
