Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Shigeaki Kuzuoka"'
Autor:
Shigeaki Kuzuoka, Naruki Joki
Publikováno v:
ITW
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::644acb0e007a76179c816f6b19c877e5
https://doi.org/10.1109/itw48936.2021.9611408
https://doi.org/10.1109/itw48936.2021.9611408
Autor:
Shigeaki Kuzuoka
Publikováno v:
ISIT
Two kinds of problems, (i) hypothesis testing with many-to-one compression and (ii) one-to-many lossy source coding with side-information at decoders, are investigated in a unified way. It is demonstrated that a simple key idea, which is developed by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::885359c02248844056c623b2a438640c
https://doi.org/10.1587/transfun.e101.a.2082
https://doi.org/10.1587/transfun.e101.a.2082
Autor:
Shigeaki Kuzuoka
Publikováno v:
ISIT
The problem of guessing subject to distortion is considered, and the performance of randomized guessing strategies is investigated. A one-shot achievability bound on the guessing moment (i.e., moment of the number of required queries) is given. Apply
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::738950766d52b0316a4feae79eabcd02
Autor:
Shigeaki Kuzuoka
Publikováno v:
ISIT
A novel definition of the conditional smooth Renyi entropy, which is different from that of Renner and Wolf, is introduced. It is shown that our definition of the conditional smooth Renyi entropy is appropriate to give lower and upper bounds on the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15102e4beb7a903b7c8afb1ff689a430
https://doi.org/10.1109/isit.2019.8849753
https://doi.org/10.1109/isit.2019.8849753
Autor:
Shigeaki Kuzuoka
Publikováno v:
ISITA
The problem of channel resolvability for channels with countably infinite input alphabet is considered. In particular, Hayashi’s lower bound (i.e., converse part) on the optimal rate of channel resolvability, which was proved under the assumption o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c16b085a16a8260f9377b51b48a4e09
https://doi.org/10.23919/isita.2018.8664277
https://doi.org/10.23919/isita.2018.8664277
Autor:
Shigeaki Kuzuoka
A novel definition of the conditional smooth Renyi entropy, which is different from that of Renner and Wolf, is introduced. It is shown that our definition of the conditional smooth Renyi entropy is appropriate to give lower and upper bounds on the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7512c8aa944b9d646058a1670f1f884
Publikováno v:
IEEE Transactions on Information Theory. 61:1574-1605
We present a novel nonasymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include: 1) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04835607cacb073bd1af3ab074662005
https://doi.org/10.1109/tit.2015.2400994
https://doi.org/10.1109/tit.2015.2400994
The Error Exponent of Zero-Rate Multiterminal Hypothesis Testing for Sources with Common Information
Autor:
Makoto Ueda, Shigeaki Kuzuoka
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :2384-2392
SUMMARY The multiterminal hypothesis testing problem with zerorate constraint is considered. For this problem, an upper bound on the optimal error exponent is given by Shalaby and Papamarcou, provided that the positivity condition holds. Our contribu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9fac0f357a6550aaf6edf49540e2778
https://doi.org/10.1587/transfun.e98.a.2384
https://doi.org/10.1587/transfun.e98.a.2384
Autor:
Shigeaki Kuzuoka, Shun Watanabe
Publikováno v:
IEEE Transactions on Information Theory. 60:7568-7583
We investigate the Wyner–Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side information is unknown except that it is in a certain class. The class consists of channels such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33e597716938e1a90cd2901ddfcc7f4a
https://doi.org/10.1109/tit.2014.2358682
https://doi.org/10.1109/tit.2014.2358682
Autor:
Shigeaki Kuzuoka
Publikováno v:
ISIT
In this paper, we consider the problem of variable-length source coding allowing errors. The exponential moment of the codeword length is analyzed in the non-asymptotic regime and in the asymptotic regime. Our results show that the smooth Renyi entro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb434bc6d55a7f3728f20118fe0fb012
https://doi.org/10.1109/isit.2016.7541398
https://doi.org/10.1109/isit.2016.7541398