72 citations · 433 across the 29 of their papers we have counts for
30 papers
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems
Tetsunao Matsuta, Tomohiko Uyematsu
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated source…
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree
Tetsunao Matsuta, Tomohiko Uyematsu
This paper addresses the rumor source identification problem, where the goal is to find the origin node of a rumor in a network among a given set of nodes with the rumor. In this p…
An Information-Theoretical Analysis of the Minimum Cost to Erase Information
Tetsunao Matsuta, Tomohiko Uyematsu
We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite t…
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem
Tetsunao Matsuta, Tomohiko Uyematsu
In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions…
Key Rate of the B92 Quantum Key Distribution Protocol with Finite Qubits
Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu
The key rate of the B92 quantum key distribution protocol had not been reported before this research when the number of qubits is finite. We compute it by using the security analys…
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu
By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2…