Universal Slepian-Wolf source codes using low-density parity-check matrices T Matsuta, T Uyematsu, R Matsumoto IEICE transactions on fundamentals of electronics, communications and …, 2010 | 17 | 2010 |

Non-asymptotic bounds for fixed-length lossy compression T Matsuta, T Uyematsu 2015 IEEE International Symposium on Information Theory (ISIT), 1811-1815, 2015 | 7 | 2015 |

On the Wyner-Ziv source coding problem with unknown delay T Matsuta, T Uyematsu IEICE Transactions on Fundamentals of Electronics, Communications and …, 2014 | 7 | 2014 |

Revisiting the rate-distortion theory using smooth max Rényi divergence T Uyematsu, T Matsuta 2014 IEEE Information Theory Workshop (ITW 2014), 202-206, 2014 | 6 | 2014 |

Revisiting the Slepian-Wolf coding problem for general sources: A direct approach T Uyematsu, T Matsuta 2014 IEEE International Symposium on Information Theory, 1336-1340, 2014 | 6 | 2014 |

Achievable rate regions for asynchronous Slepian-Wolf coding systems T Matsuta, T Uyematsu 2015 IEEE Information Theory Workshop-Fall (ITW), 312-316, 2015 | 5 | 2015 |

Coding theorems for asynchronous Slepian–Wolf coding systems T Matsuta, T Uyematsu IEEE Transactions on Information Theory 66 (8), 4774-4795, 2020 | 3 | 2020 |

Caching-aided multicast for partial information T Matsuta, T Uyematsu 2016 IEEE International Symposium on Information Theory (ISIT), 600-604, 2016 | 3 | 2016 |

Universal coding for asynchronous Slepian-Wolf coding systems T Matsuta, T Uyematsu IEICE Technical Report; IEICE Tech. Rep. 112 (460), 1-6, 2013 | 3 | 2013 |

An information-theoretical analysis of the minimum cost to erase information T Matsuta, T Uyematsu IEICE Transactions on Fundamentals of Electronics, Communications and …, 2018 | 2 | 2018 |

Source coding with side information at the decoder revisited T Uyematsu, T Matsuta 2015 IEEE International Symposium on Information Theory (ISIT), 1570-1574, 2015 | 2 | 2015 |

New non-asymptotic achievability and converse bounds for fixed-length lossy compression T Matsuta, T Uyematsu Proc. 37th Symp. Inform. Theory and its Apps.(SITA2014), 189-194, 2014 | 2 | 2014 |

Identification Capacity of a Biometrical Identification System Using List Decording M Mori, T Matsuta, R Matsumoto, T Uyematsu IEICE Technical Report; IEICE Tech. Rep. 113 (483), 249-254, 2014 | 2 | 2014 |

A general formula of rate-distortion functions for source coding with side information at many decoders T Matsuta, T Uyematsu 2012 IEEE International Symposium on Information Theory Proceedings, 174-178, 2012 | 2 | 2012 |

An equivalent expression for the Wyner-Ziv source coding problem T Matsuta, T Uyematsu 2020 International Symposium on Information Theory and Its Applications …, 2020 | 1 | 2020 |

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree T Matsuta, T Uyematsu arXiv preprint arXiv:1901.03039, 2019 | 1 | 2019 |

Joint Channel Coding and Intrinsic Randomness T Uyematsu, T Matsuta IEICE Transactions on Fundamentals of Electronics, Communications and …, 2018 | 1 | 2018 |

Non-asymptotic bounds and a general formula for the rate-distortion region of the successive refinement problem T Matsuta, T Uyematsu IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2018 | 1 | 2018 |

Achievable rate regions for source coding with delayed partial side information T Matsuta, T Uyematsu 2018 International Symposium on Information Theory and Its Applications …, 2018 | 1 | 2018 |

On the minimum worst-case cost and the minimum average cost to erase information T Matsuta, T Uyematsu 2017 IEEE Information Theory Workshop (ITW), 254-258, 2017 | 1 | 2017 |