default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsunao Matsuta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Tomohiko Uyematsu, Tetsunao Matsuta:
Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 393-403 (2024)- 2022
- [j14]Tetsunao Matsuta, Tomohiko Uyematsu:
An Equivalent Expression for the Wyner-Ziv Source Coding Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 353-362 (2022) - 2020
- [j13]Tetsunao Matsuta
, Tomohiko Uyematsu:
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. IEEE Trans. Inf. Theory 66(8): 4774-4795 (2020) - [c16]Tetsunao Matsuta, Tomohiko Uyematsu:
An Equivalent Expression for the Wyner-Ziv Source Coding Problem. ISITA 2020: 21-25
2010 – 2019
- 2019
- [j12]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions for Source Coding with Delayed Partial Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1631-1641 (2019) - [c15]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. ISIT 2019: 2334-2338 - [i4]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. CoRR abs/1901.03039 (2019) - [i3]Tetsunao Matsuta, Tomohiko Uyematsu:
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. CoRR abs/1906.02929 (2019) - 2018
- [j11]Tomohiko Uyematsu, Tetsunao Matsuta:
Joint Channel Coding and Intrinsic Randomness. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2091-2098 (2018) - [j10]Tetsunao Matsuta, Tomohiko Uyematsu:
An Information-Theoretical Analysis of the Minimum Cost to Erase Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2099-2109 (2018) - [j9]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2110-2124 (2018) - [c14]Tomohiko Uyematsu, Tetsunao Matsuta:
Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels. ISITA 2018: 276-280 - [c13]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions for Source Coding with Delayed Partial Side Information. ISITA 2018: 369-373 - [i2]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem. CoRR abs/1802.07458 (2018) - [i1]Tetsunao Matsuta, Tomohiko Uyematsu:
An Information-Theoretical Analysis of the Minimum Cost to Erase Information. CoRR abs/1802.07462 (2018) - 2017
- [j8]Tomohiko Uyematsu, Tetsunao Matsuta:
Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2615-2628 (2017) - [j7]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2629-2640 (2017) - [c12]Tetsunao Matsuta, Tomohiko Uyematsu:
On the minimum worst-case cost and the minimum average cost to erase information. ITW 2017: 254-258 - 2016
- [j6]Tetsunao Matsuta, Tomohiko Uyematsu:
New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2116-2129 (2016) - [c11]Tetsunao Matsuta, Tomohiko Uyematsu:
Caching-aided multicast for partial information. ISIT 2016: 600-604 - 2015
- [c10]Tomohiko Uyematsu, Tetsunao Matsuta:
Source coding with side information at the decoder revisited. ISIT 2015: 1570-1574 - [c9]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-asymptotic bounds for fixed-length lossy compression. ISIT 2015: 1811-1815 - [c8]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable rate regions for asynchronous Slepian-Wolf coding systems. ITW Fall 2015: 312-316 - 2014
- [j5]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Wyner-Ziv Source Coding Problem with Unknown Delay. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(12): 2288-2299 (2014) - [c7]Tetsunao Matsuta, Tomohiko Uyematsu:
Rate-distortion functions for source coding when side information with unknown delay may be present. ISIT 2014: 936-940 - [c6]Tomohiko Uyematsu, Tetsunao Matsuta:
Revisiting the Slepian-Wolf coding problem for general sources: A direct approach. ISIT 2014: 1336-1340 - [c5]Tomohiko Uyematsu, Tetsunao Matsuta:
Revisiting the rate-distortion theory using smooth max Rényi divergence. ITW 2014: 202-206 - 2013
- [j4]Tetsunao Matsuta, Tomohiko Uyematsu:
Random-Coding Exponential Error Bounds for Channels with Action-Dependent States. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2324-2331 (2013) - [c4]Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula for capacity of channels with action-dependent states. ISIT 2013: 2473-2477 - 2012
- [j3]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Parametric Forms of the Achievable Rate Region for Source Coding with a Helper. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2493-2497 (2012) - [c3]Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula of rate-distortion functions for source coding with side information at many decoders. ISIT 2012: 174-178 - 2011
- [j2]Tetsunao Matsuta, Tomohiko Uyematsu:
A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2105-2120 (2011) - 2010
- [j1]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1878-1888 (2010) - [c2]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf source codes using low-density parity-check matrices. ISIT 2010: 186-190
2000 – 2009
- 2009
- [c1]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Closed forms of the achievable rate region for Wyner's source coding systems. ISIT 2009: 1214-1218
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
