#### Filter Results:

- Full text PDF available (149)

#### Publication Year

1996

2017

- This year (22)
- Last 5 years (91)
- Last 10 years (137)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

Learn More

- Masahito Hayashi
- IEEE Transactions on Information Theory
- 2009

In this paper, second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint <i>epsiv</i> is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, theâ€¦ (More)

- Masahito Hayashi, Hiroshi Nagaoka
- IEEE Transactions on Information Theory
- 2003

The capacity of a classical-quantum channel (or, in other words, the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallelâ€¦ (More)

- Masahito Hayashi
- IEEE Transactions on Information Theory
- 2011

We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett 's bound based on the Rényi entropy of order 2 because the bound obtained here uses the Rényi entropy of order 1+<i>s</i> for <i>s</i> ∈ [0,1]. This bound is applied to a wire-tapâ€¦ (More)

- Masahito Hayashi
- IEEE Transactions on Information Theory
- 2008

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 general information sources and then investigate independent and identically distributed (i.i.d.) random variables and Markovian variables as examples. The difference isâ€¦ (More)

- Marco Tomamichel, Masahito Hayashi
- IEEE Transactions on Information Theory
- 2013

We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-orderâ€¦ (More)

- Masahito Hayashi
- 2006

Masahito Hayashi ERATO-SORST Quantum Computation and Information Project, Japan Science and Technology Agency, 201 Daini Hongo White Bldg. 5-28-3, Hongo, Bunkyo-ku, Tokyo 113-0033, Japan. Superrobust Computation Project, Information Science and Technology Strategic Core (21st Century COE by MEXT), Graduate School of Information Science and Technology, Theâ€¦ (More)

- Masahito Hayashi
- 2002

We derive a necessary and sufficient condition for a sequence of quantum measurements to achieve the optimal performance in quantum hypothesis testing. Using an information-spectrum method, we discuss what quantum measurement we should perform in order to attain the optimal exponent of the second error probability under the condition that the first errorâ€¦ (More)

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptoticallyâ€¦ (More)

- Masahito Hayashi, Ryutaroh Matsumoto
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new privacy amplification theorem bounding the eavesdropped information in terms of the Gallager function.

- Masahito Hayashi, Himanshu Tyagi, Shun Watanabe
- 2014 52nd Annual Allerton Conference onâ€¦
- 2014

We establish an upper bound on the rate of codes for a wiretap channel with public feedback for a fixed probability of error and secrecy parameter. As a corollary, we obtain a strong converse for the capacity of a degraded wiretap channel with public feedback. Our converse proof is based on a reduction of active hypothesis testing for discriminating betweenâ€¦ (More)