Ryo Nomura

CoRR, 2023

Optimum Self-Random Number Generation Rate and Its Application to RDP Function.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Relationship Between Intrinsic Randomness with f-Divergence and Fixed-Length Source Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Optimum Intrinsic Randomness Rate with Respect to f -Divergences Using the Smooth Min Entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Source Resolvability and Intrinsic Randomness: Two Random Number Generation Problems With Respect to a Subclass of f-Divergences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Stochastic Discrete First-Order Algorithm for Feature Subset Selection.

[BibT_eX]

[DOI]

Kota Kudo

Yuichi Takano

IEICE Trans. Inf. Syst., 2020

Relationship Between Source Resolvability with Normalized f -Divergence and Fixed-Length Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Rényi Entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Overflow Probability of Variable-Length Codes With Codeword Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Intrinsic Randomness Problem with Respect to a Subclass of f-divergence.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Source resolvability problem with respect to a certain subclass of f-divergence.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources.

[BibT_eX]

[DOI]

Entropy, 2018

Plane graphs without homeomorphically irreducible spanning trees.

[BibT_eX]

Shoichi Tsuchiya

Ars Comb., 2018

Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Source Resolvability with Kullback-Leibler Divergence.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Overflow probability of variable-length codes allowing non-vanishing error probability.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

First- and second-order hypothesis testing for mixed memoryless sources with general mixture.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Variable-length lossy source coding allowing some probability of union of overflow and excess distortion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Variable-length coding with epsilon-fidelity criteria for general sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Channel dispersion for well-ordered mixed channels decomposed into memoryless channels.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

Single-letter characterization of epsilon-capacity for mixed memoryless channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

Second-Order Slepian-Wolf Source Coding for Mixed Sources

[BibT_eX]

[DOI]

CoRR, 2012

Information spectrum approach to overflow probability of variable-length codes with conditional cost function.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Second-order achievable rates in random number generation for mixed sources.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources

[BibT_eX]

[DOI]

CoRR, 2011

2010

On the overflow probability of lossless codes with side information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

On the Condition of epsilon-Transmissible Joint Source-Channel Coding for General Sources and General Channels.

[BibT_eX]

[DOI]

Shigeichi Hirasawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2007

A Note on the epsilon-Overflow Probability of Lossless Codes.

[BibT_eX]

[DOI]

Shigeichi Hirasawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

On the -overflow probability of lossless codes.

[BibT_eX]

[DOI]