Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Kuzuoka, Shigeaki"'
Autor:
Kuzuoka, Shigeaki
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:
http://arxiv.org/abs/2012.04901
Autor:
Kuzuoka, Shigeaki
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:
http://arxiv.org/abs/1810.09070
Autor:
Immink, Kees A. Schouhamer, Baggen, Stan, Chaabane, Ferdaous, Chen, Yanling, de With, Peter H. N., Gassara, Hela, Gharbi, Hamed, Ghazel, Adel, Grati, Khaled, Grigoryan, Naira M., Harutyunyan, Ashot, Imanishi, Masayuki, Iwamoto, Mitsugu, Iwata, Ken-ichi, Kamabe, Hiroshi, Kurkoski, Brian M., Kuzuoka, Shigeaki, Langenhuizen, Patrick, Lewandowsky, Jan, Manada, Akiko, Miyake, Shigeki, Morita, Hiroyoshi, Muramatsu, Jun, Najjar, Safa, Poghosyan, Arnak V., Rouissi, Fatma, Sakai, Yuta, Tamm, Ulrich, van der Putten, Joost, van der Sommen, Fons, Vinck, A. J. Han, Wadayama, Tadashi, Wübben, Dirk, Yamamoto, Hirosuke
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperation between Asian and European scientists. The first workshop was held
Externí odkaz:
http://arxiv.org/abs/1707.08567
Autor:
Kuzuoka, Shigeaki, Watanabe, Shun
The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be computed,
Externí odkaz:
http://arxiv.org/abs/1602.08204
Autor:
Kuzuoka, Shigeaki
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:
http://arxiv.org/abs/1512.06499
Autor:
Kuzuoka, Shigeaki, Watanabe, Shun
The problem of distributed data compression for function computation is considered, where (i) the function to be computed is not necessarily symbol-wise function and (ii) the information source has memory and may not be stationary nor ergodic. We int
Externí odkaz:
http://arxiv.org/abs/1408.5971
Autor:
Kuzuoka, Shigeaki, Watanabe, Shun
This paper studies variable-length (VL) source coding of general sources with side-information. Novel one-shot coding theorems for coding with common side-information available at the encoder and the decoder and Slepian- Wolf (SW) coding (i.e., with
Externí odkaz:
http://arxiv.org/abs/1401.3809
Autor:
Watanabe, Shun, Kuzuoka, Shigeaki
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 t
Externí odkaz:
http://arxiv.org/abs/1302.0050
We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited
Externí odkaz:
http://arxiv.org/abs/1301.6467
A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be att
Externí odkaz:
http://arxiv.org/abs/1004.3085