Slepian–Wolf coding with quantum side information

X Liu, Z **, H Fan - Quantum Information Processing, 2023 - Springer
In this paper, we consider the classical Slepian–Wolf coding with quantum side information,
corresponding to the compression of two correlated classical parts, using their quantum …

Finite-block-length analysis in classical and quantum information theory

M Hayashi - Proceedings of the Japan Academy, Series B, 2017 - jstage.jst.go.jp
Coding technology is used in several information processing tasks. In particular, when noise
during transmission disturbs communications, coding technology is employed to protect the …

[HTML][HTML] Optimum Achievable Rates in Two Random Number Generation Problems with f-Divergences Using Smooth Rényi Entropy

R Nomura, H Yagi - Entropy, 2024 - mdpi.com
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 …

Optimum Self-Random Number Generation Rate and Its Application to RDP Function

R Nomura - 2023 IEEE International Symposium on Information …, 2023 - ieeexplore.ieee.org
The self-random number generation (SRNG) problem is considered for general setting. In
the literature, the optimum SRNG rate with respect to the variational distance has been …

Relative entropies and their use in quantum information theory

F Leditzky - arxiv preprint arxiv:1611.08802, 2016 - arxiv.org
This dissertation investigates relative entropies, also called generalized divergences, and
how they can be used to characterize information-theoretic tasks in quantum information …

Optimum Self Random Number Generation Rate and Its Application to Rate Distortion Perception Function

R Nomura - arxiv preprint arxiv:2311.15220, 2023 - arxiv.org
The self-random number generation (SRNG) problem is considered for general setting. In
the literature, the optimum SRNG rate with respect to the variational distance has been …

The Achievable Rate Region of Wyner-Ahlswede-Körner Coding Problem for Mixed Sources

D Takeuchi, S Watanabe - 2021 IEEE Information Theory …, 2021 - ieeexplore.ieee.org
The achievable rate region of Wyner-Ahlswede-Körner coding problem for mixed sources is
investigated. Wyner-Ahlswede-Körner coding problem consists of two encoders and one …

First-and second-order hypothesis testing for mixed memoryless sources

TS Han, R Nomura - Entropy, 2018 - mdpi.com
The first-and second-order optimum achievable exponents in the simple hypothesis testing
problem are investigated. The optimum achievable exponent for type II error probability …

Channel resolvability theorems for general sources and channels

H Yagi - 2017 IEEE International Symposium on Information …, 2017 - ieeexplore.ieee.org
In the problem of channel resolvability, where a given output probability distribution via a
channel is approximated by transforming the uniform random numbers, characterizing the …

Source resolvability with Kullback-Leibler divergence

R Nomura - 2018 IEEE International Symposium on Information …, 2018 - ieeexplore.ieee.org
The first-and second-order optimum achievable rates in the source resolvability problem are
considered for general sources. In the literature, the achievable rates in the resolvability …