Published Papers - KUZUOKA Shigeaki

Slepian-Wolf Coding of Individual Sequences Based on Ensembles of Linear Functions

Shigeaki Kuzuoka

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E92A ( 10 ) 2393 - 2401   2009.10  [Refereed]

　View Summary

This paper clarifies the adequacy of the linear channel coding approach for Slepian-Wolf coding of individual sequences. A sufficient condition for ensembles of linear codes from which a universal Slepian-Wolf code can be constructed is given. Our result reveals that an ensemble of LDPC codes gives a universal code for Slepian-Wolf coding of individual sequences.

DOI

Universal source coding over generalized complementary delivery networks

Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe

IEICE Trans. Fundamentals     2009.03  [Refereed]

On the Suboptimality of Linear Lossy Codes

Shigeaki Kuzuoka

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E91A ( 10 ) 2868 - 2869   2008.10  [Refereed]

　View Summary

This letter reveals that linear lossy codes cannot attain the rate-distortion function in general, even if the source is binary i.i.d. and the distortion is measured by the Hamming distortion measure.

DOI

An application of linear codes to the problem of source coding with partial side information

Shigeaki Kuzuoka

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E91A ( 8 ) 2151 - 2158   2008.08  [Refereed]

　View Summary

This paper clarifies the adequacy of the linear channel coding approach for the source coding with partial side information at the decoder. A sufficient condition for an ensemble of linear codes which achieves the Wyner's bound is given. Our result reveals that, by combining a good lossy code, an LDPC code ensemble gives a good code for source coding with partial side information at the decoder.

DOI

Fixed-slope universal lossy coding for individual sequences and nonstationary sources

Shigeaki Kuzuoka, Tomohiko Uyematsu

IEICE Trans. Fundamentals     2008.03  [Refereed]

Universal lossy coding for individual sequences based on complexity functions

Shigeaki Kuzuoka, Tomohiko Uyematsu

IEICE Trans. Fundamentals     2007.02  [Refereed]

Universal coding for correlated sources with complementary delivery

Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka

IEICE Trans. Fundamentals ( IEEE )  E90-A ( 2 ) 1840 - 1847   2007  [Refereed]

　View Summary

This report deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses.

Relationship among complexities of individual sequences over countable alphabet

Shigeaki Kuzuoka, Tomohiko Uyematsu

IEICE Trans. Fundamentals     2006.07  [Refereed]

Fixed-slope universal lossy coding for individual sequences

Shigeaki Kuzuoka, Tomohiko Uyematsu

PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP ( IEEE )    244 - +   2006  [Refereed]

　View Summary

In a theory of lossy coding of individual sequences, two kinds of coding schemes, the fixed-rate coding and the fixed-distortion coding, have been studied. This paper investigates another kind of lossy coding scheme of individual sequences, which is called fixed-slope lossy coding. We show that the optimal cost attainable by the blockwise fixed-slope lossy encoder is equal to the optimal average cost with respect to the overlapping empirical distribution of the given sequence. Moreover, we clarify that the fixed-slope universal lossy block encoder based on the complexity function achieves the optimal cost. As an application of the result, we show that for any ergodic source the sample average of the cost achieved by the lossy block encoder based on the complexity function is asymptotically equal to the optimal cost with probability one.

Applicability of the sample path method of ergodic processes to individual sequences

S Kuzuoka, T Uyematsu

2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS ( IEEE )    561 - 561   2004  [Refereed]

　View Summary

This paper proposes a method which enables to apply some results on ergodic sources to individual sequences. As an example, we show the recurrence time theorem for individual sequences.

Conditional Lempel-Ziv complexity and its application to source coding theorem with side information

T Uyematsu, S Kuzuoka

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E86A ( 10 ) 2615 - 2617   2003.10  [Refereed]

　View Summary

This paper proposes the conditional LZ complexity and analyzes its property. Especially, we show an inequality corresponding to Ziv's inequality concerning a distinct parsing of a pair of sequences. Further, as a byproduct of the result, we show a simple proof of the asymptotical optimality of Ziv's universal source coding algorithm with side information.