default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyo Nomura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ryo Nomura
, Hideki Yagi:
Optimum Achievable Rates in Two Random Number Generation Problems with f-Divergences Using Smooth Rényi Entropy. Entropy 26(9): 766 (2024)- [i11]Ryo Nomura, Hideki Yagi:
Optimum Achievable Rates in Two Random Number Generation Problems with f-Divergences Using Smooth R\'enyi Entropy. CoRR abs/2404.11097 (2024) - 2023
- [c25]Ryo Nomura:
Optimum Self-Random Number Generation Rate and Its Application to RDP Function. ISIT 2023: 460-465 - [i10]Ryo Nomura:
Optimum Self Random Number Generation Rate and Its Application to Rate Distortion Perception Function. CoRR abs/2311.15220 (2023) - 2022
- [c24]Ryo Nomura:
Relationship Between Intrinsic Randomness with f-Divergence and Fixed-Length Source Coding. ISIT 2022: 228-233 - 2021
- [c23]Ryo Nomura, Hideki Yagi:
Optimum Intrinsic Randomness Rate with Respect to f -Divergences Using the Smooth Min Entropy. ISIT 2021: 1784-1789 - 2020
- [j14]Kota Kudo, Yuichi Takano, Ryo Nomura:
Stochastic Discrete First-Order Algorithm for Feature Subset Selection. IEICE Trans. Inf. Syst. 103-D(7): 1693-1702 (2020) - [j13]Ryo Nomura:
Source Resolvability and Intrinsic Randomness: Two Random Number Generation Problems With Respect to a Subclass of f-Divergences. IEEE Trans. Inf. Theory 66(12): 7588-7601 (2020) - [c22]Ryo Nomura, Hideki Yagi:
Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Rényi Entropy. ISIT 2020: 2286-2291 - [c21]Ryo Nomura:
Relationship Between Source Resolvability with Normalized f -Divergence and Fixed-Length Coding. ITW 2020: 1-5
2010 – 2019
- 2019
- [j12]Ryo Nomura:
Overflow Probability of Variable-Length Codes With Codeword Cost. IEEE Trans. Inf. Theory 65(12): 8194-8206 (2019) - [j11]Ryo Nomura, Hideki Yagi:
Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability. IEEE Trans. Inf. Theory 65(12): 8213-8221 (2019) - [c20]Ryo Nomura:
Source resolvability problem with respect to a certain subclass of f-divergence. ISIT 2019: 2234-2238 - [c19]Ryo Nomura:
Intrinsic Randomness Problem with Respect to a Subclass of f-divergence. ITW 2019: 1-5 - 2018
- [j10]Ryo Nomura, Shoichi Tsuchiya:
Plane graphs without homeomorphically irreducible spanning trees. Ars Comb. 141: 157-165 (2018) - [j9]Te Sun Han, Ryo Nomura:
First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources. Entropy 20(3): 174 (2018) - [c18]Ryo Nomura:
Source Resolvability with Kullback-Leibler Divergence. ISIT 2018: 2042-2046 - [c17]Ryo Nomura, Hideki Yagi:
Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. ISITA 2018: 364-368 - [i9]Ryo Nomura, Hideki Yagi:
Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability. CoRR abs/1810.07863 (2018) - 2017
- [j8]Hideki Yagi, Ryo Nomura:
Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(8): 1683-1692 (2017) - [c16]Te Sun Han, Ryo Nomura:
First- and second-order hypothesis testing for mixed memoryless sources with general mixture. ISIT 2017: 126-130 - [c15]Ryo Nomura, Hideki Yagi:
Overflow probability of variable-length codes allowing non-vanishing error probability. ITW 2017: 589-593 - [i8]Te Sun Han, Ryo Nomura:
First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources with General Mixture. CoRR abs/1703.06279 (2017) - 2016
- [j7]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture. IEEE Trans. Inf. Theory 62(8): 4395-4412 (2016) - [c14]Ryo Nomura, Hideki Yagi:
Variable-length lossy source coding allowing some probability of union of overflow and excess distortion. ISIT 2016: 2958-2962 - [c13]Hideki Yagi, Ryo Nomura:
Variable-length coding with cost allowing non-vanishing error probability. ISITA 2016: 16-20 - [i7]Hideki Yagi, Ryo Nomura:
Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability. CoRR abs/1610.01749 (2016) - 2015
- [c12]Ryo Nomura, Hideki Yagi:
Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability. ISIT 2015: 306-310 - [c11]Hideki Yagi, Ryo Nomura:
Variable-length coding with epsilon-fidelity criteria for general sources. ISIT 2015: 2181-2185 - [c10]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and second-order coding theorems for mixed memoryless channels with general mixture. ISIT 2015: 2969-2973 - [i6]Hideki Yagi, Te Sun Han, Ryo Nomura:
First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture. CoRR abs/1501.05887 (2015) - 2014
- [j6]Ryo Nomura, Te Sun Han:
Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources. IEEE Trans. Inf. Theory 60(9): 5553-5572 (2014) - [c9]Hideki Yagi, Ryo Nomura:
Single-letter characterization of epsilon-capacity for mixed memoryless channels. ISIT 2014: 2874-2878 - [c8]Hideki Yagi, Ryo Nomura:
Channel dispersion for well-ordered mixed channels decomposed into memoryless channels. ISITA 2014: 35-39 - [i5]Hideki Yagi, Ryo Nomura:
Single-Letter Characterization of Epsilon-Capacity for Mixed Memoryless Channels. CoRR abs/1407.0124 (2014) - 2013
- [j5]Ryo Nomura, Te Sun Han:
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach. IEEE Trans. Inf. Theory 59(1): 1-16 (2013) - [c7]Ryo Nomura, Te Sun Han:
Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources. ISIT 2013: 1974-1978 - [i4]Ryo Nomura:
Overflow Probability of Variable-length Codes with Codeword Cost. CoRR abs/1310.2001 (2013) - 2012
- [c6]Ryo Nomura, Te Sun Han:
Second-order achievable rates in random number generation for mixed sources. ISIT 2012: 816-820 - [c5]Ryo Nomura, Toshiyasu Matsushima:
Information spectrum approach to overflow probability of variable-length codes with conditional cost function. ISIT 2012: 1097-1101 - [i3]Ryo Nomura, Toshiyasu Matsushima:
Information Spectrum Approach to Overflow Probability of Variable-Length Codes with Conditional Cost Function. CoRR abs/1205.1242 (2012) - [i2]Ryo Nomura, Te Sun Han:
Second-Order Slepian-Wolf Source Coding for Mixed Sources. CoRR abs/1207.2505 (2012) - 2011
- [j4]Ryo Nomura, Toshiyasu Matsushima:
On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2083-2091 (2011) - [j3]Ryo Nomura, Toshiyasu Matsushima:
An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2220-2225 (2011) - [i1]Ryo Nomura, Te Sun Han:
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources. CoRR abs/1106.1879 (2011) - 2010
- [c4]Ryo Nomura, Toshiyasu Matsushima:
On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information. DCC 2010: 548 - [c3]Ryo Nomura, Toshiyasu Matsushima:
On the overflow probability of lossless codes with side information. ISIT 2010: 131-135
2000 – 2009
- 2009
- [j2]Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa:
On the Condition of epsilon-Transmissible Joint Source-Channel Coding for General Sources and General Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11): 2936-2940 (2009) - 2007
- [j1]Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa:
A Note on the epsilon-Overflow Probability of Lossless Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(12): 2965-2970 (2007) - [c2]Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa:
On the -overflow probability of lossless codes. ISIT 2007: 441-445
1990 – 1999
- 1990
- [c1]Akira Nagoya, Yukihiro Nakamura, Kiyoshi Oguri, Ryo Nomura:
Multi-Level Optimization for Large Scale ASICS. ICCAD 1990: 564-567
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 2024-10-23 20:32 CEST 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:
