40 citations · 62 across the 9 of their papers we have counts for
11 papers
Isomorphism Problem Revisited: Information Spectrum Approach
Shun Watanabe, Te Sun Han
The isomorphism problem in the ergodic theory is revisited from the perspective of information spectrum approach, an approach that has been developed to investigate coding problems…
Wiretap channels with causal and non-causal state information: revisited
Te Sun Han, Masahide Sasaki
The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here part…
Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding
Hideki Yagi, Te Sun Han
In the problem of variable-length -channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the va…
Variable-Length Resolvability for General Sources and Channels
Hideki Yagi, Te Sun Han
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number,…
Numerical Study on Secrecy Capacity and Code Length Dependence of the Performances in Optical Wiretap Channels
Hiroyuki Endo, Te Sun Han, Takao Aoki +1
Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy…
Polymatroids with Network Coding
Te Sun Han
The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the c…