Closed forms of the achievable rate region for Wyner's source coding systems. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (ISIT, 2009)

Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

A general formula of rate-distortion functions for source coding with side information at many decoders. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2012)

Parametric Forms of the Achievable Rate Region for Source Coding with a Helper. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

A general formula for capacity of channels with action-dependent states. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2013)

Random-Coding Exponential Error Bounds for Channels with Action-Dependent States. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Rate-distortion functions for source coding when side information with unknown delay may be present. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2014)

Revisiting the Slepian-Wolf coding problem for general sources: A direct approach. - Tomohiko Uyematsu; Tetsunao Matsuta (ISIT, 2014)

Revisiting the rate-distortion theory using smooth max Rényi divergence. - Tomohiko Uyematsu; Tetsunao Matsuta (ITW, 2014)

On the Wyner-Ziv Source Coding Problem with Unknown Delay. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Non-asymptotic bounds for fixed-length lossy compression. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2015)

Source coding with side information at the decoder revisited. - Tomohiko Uyematsu; Tetsunao Matsuta (ISIT, 2015)

Achievable rate regions for asynchronous Slepian-Wolf coding systems. - Tetsunao Matsuta; Tomohiko Uyematsu (ITW Fall, 2015)

Caching-aided multicast for partial information. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2016)

New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

On the minimum worst-case cost and the minimum average cost to erase information. - Tetsunao Matsuta; Tomohiko Uyematsu (ITW, 2017)

Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels. - Tomohiko Uyematsu; Tetsunao Matsuta (ISITA, 2018)

An Information-Theoretical Analysis of the Minimum Cost to Erase Information. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Joint Channel Coding and Intrinsic Randomness. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2019)

Achievable Rate Regions for Source Coding with Delayed Partial Side Information. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. - Tetsunao Matsuta; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2020)

An Equivalent Expression for the Wyner-Ziv Source Coding Problem. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Achievable Cost Region for Erasure of Distributed Information Using a Common Random Number. - Tetsunao Matsuta (ISITA, 2024)

Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)