activity
20072020
most citedNon-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information

11 citations · 36 across the 11 of their papers we have counts for

collaborators

14 papers

cs.IT2020

Asynchronous Guessing Subject to Distortion

Shigeaki Kuzuoka

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 m…

cs.IT2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory

A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama +24

This year, 2019 we celebrate 30 years of our friendship between Asian and European scientists at the AEW11 in Rotterdam, the Netherlands. Many of the 1989 participants are also pre…

cs.IT2018

On the Conditional Smooth Renyi Entropy and its Applications in Guessing and Source Coding

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 smoot…

cs.IT2017

Proceedings of Workshop AEW10: Concepts in Information Theory and Communications

Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane +31

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 cooperati…

cs.IT2016

On Distributed Computing for Functions with Certain Structures

Shigeaki Kuzuoka, Shun Watanabe

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 c…

cs.IT2015

On the Smooth Renyi Entropy and Variable-Length Source Coding Allowing Errors

Shigeaki Kuzuoka

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…