Updated on 2024/11/16

写真a

 
KUZUOKA Shigeaki
 
Name of department
Faculty of Systems Engineering, Network Informatics
Job title
Professor
Concurrent post
Informatics Division(Professor)
Mail Address
E-mail address
External link

Education

  • 2002
    -
    2007

    Tokyo Institute of Technology   Graduate School of Science and Engineering   Communications and Integrated Systems  

  • 1998
    -
    2002

    Tokyo Institute of Technology   Faculty of Engineering   Department of Computer Science  

Degree

  • 博士(工学)

Academic & Professional Experience

  • 2007.04
    -
    Now

    Wakayama University   Faculty of Systems Engineering

Research Areas

  • Manufacturing technology (mechanical, electrical/electronic, chemical engineering) / Communication and network engineering

  • Informatics / Information theory

Classes (including Experimental Classes, Seminars, Graduation Thesis Guidance, Graduation Research, and Topical Research)

  • 2023   Information Processing ⅡB   Liberal Arts and Sciences Subjects

  • 2023   Information Processing ⅡB   Liberal Arts and Sciences Subjects

  • 2023   Information Processing ⅡB   Liberal Arts and Sciences Subjects

  • 2023   Information Processing ⅡA   Liberal Arts and Sciences Subjects

  • 2023   Information Processing ⅡA   Liberal Arts and Sciences Subjects

  • 2023   Information Processing ⅡA   Liberal Arts and Sciences Subjects

  • 2023   Graduation Research   Specialized Subjects

  • 2023   Network Informatics Seminar   Specialized Subjects

  • 2023   Exercises in Majors B   Specialized Subjects

  • 2023   Graduation Research   Specialized Subjects

  • 2023   Information Theory   Specialized Subjects

  • 2023   Probability and Statistics   Specialized Subjects

  • 2023   Probability and Statistics   Specialized Subjects

  • 2023   Probability and Statistics   Specialized Subjects

  • 2023   Information Security and Ethics2   Specialized Subjects

  • 2023   Information Security and Ethics1   Specialized Subjects

  • 2023   Exercises in Majors A   Specialized Subjects

  • 2023   Introduction to Latest Information Technology   Specialized Subjects

  • 2022   Information Processing ⅠIB   Liberal Arts and Sciences Subjects

  • 2022   Information Processing ⅠIA   Liberal Arts and Sciences Subjects

  • 2022   NA   Specialized Subjects

  • 2022   Information Processing ⅠB   Liberal Arts and Sciences Subjects

  • 2022   Information Processing ⅠA   Liberal Arts and Sciences Subjects

  • 2022   Graduation Research   Specialized Subjects

  • 2022   Graduation Research   Specialized Subjects

  • 2022   Information Theory   Specialized Subjects

  • 2022   Information Theory   Specialized Subjects

  • 2022   Probability and Statistics   Specialized Subjects

  • 2022   Probability and Statistics   Specialized Subjects

  • 2022   Probability and Statistics   Specialized Subjects

  • 2022   Network Informatics Seminar   Specialized Subjects

  • 2022   Introductory Seminar in Systems Engineering   Specialized Subjects

  • 2021   NA   Specialized Subjects

  • 2021   Probability and Statistics   Specialized Subjects

  • 2021   Probability and Statistics   Specialized Subjects

  • 2021   Probability and Statistics   Specialized Subjects

  • 2021   Network Informatics Seminar   Specialized Subjects

  • 2021   Graduation Research   Specialized Subjects

  • 2021   Graduation Research   Specialized Subjects

  • 2021   Information Theory   Specialized Subjects

  • 2021   Information Processing ⅠB   Liberal Arts and Sciences Subjects

  • 2021   Information Processing ⅠA   Liberal Arts and Sciences Subjects

  • 2020   NA   Specialized Subjects

  • 2020   Graduation Research   Specialized Subjects

  • 2020   Graduation Research   Specialized Subjects

  • 2020   Introductory Seminar in Systems Engineering   Specialized Subjects

  • 2020   Network Informatics Seminar   Specialized Subjects

  • 2020   Information Theory   Specialized Subjects

  • 2020   Probability and Statistics   Specialized Subjects

  • 2020   Probability and Statistics   Specialized Subjects

  • 2020   Probability and Statistics   Specialized Subjects

  • 2019   NA   Liberal Arts and Sciences Subjects

  • 2019   Network Informatics Seminar   Specialized Subjects

  • 2019   Information Theory   Specialized Subjects

  • 2019   Information Theory   Specialized Subjects

  • 2019   Probability and Statistics   Specialized Subjects

  • 2018   NA   Liberal Arts and Sciences Subjects

  • 2018   Introduction to Majors 2   Specialized Subjects

  • 2018   Graduation Research   Specialized Subjects

  • 2018   Network Informatics Seminar   Specialized Subjects

  • 2018   Introduction to Majors 2   Specialized Subjects

  • 2018   Information Theory   Specialized Subjects

  • 2018   Information Theory   Specialized Subjects

  • 2018   Probability and Statistics   Specialized Subjects

  • 2017   Introduction to Majors 2   Specialized Subjects

  • 2017   NA   Liberal Arts and Sciences Subjects

  • 2017   Graduation Research   Specialized Subjects

  • 2017   Introductory Seminar in Systems Engineering   Specialized Subjects

  • 2017   Information Theory   Specialized Subjects

  • 2017   Information Theory   Specialized Subjects

  • 2017   Probability and Statistics   Specialized Subjects

  • 2016   NA   Liberal Arts and Sciences Subjects

  • 2016   Graduation Research   Specialized Subjects

  • 2016   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2016   Introductory Seminar in Systems Engineering   Specialized Subjects

  • 2016   Information Theory   Specialized Subjects

  • 2016   Information Theory   Specialized Subjects

  • 2016   Information Theory   Specialized Subjects

  • 2016   Information Theory   Specialized Subjects

  • 2016   Probability and Statistics   Specialized Subjects

  • 2016   Introduction to Majors 2   Specialized Subjects

  • 2015   NA   Liberal Arts and Sciences Subjects

  • 2015   Graduation Research   Specialized Subjects

  • 2015   Introduction to Majors 2   Specialized Subjects

  • 2015   Practice in Basic C Programming   Specialized Subjects

  • 2015   Graduation Research   Specialized Subjects

  • 2015   Information Theory   Specialized Subjects

  • 2015   Information Theory   Specialized Subjects

  • 2015   Information Theory   Specialized Subjects

  • 2015   Information Theory   Specialized Subjects

  • 2015   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2015   Probability and Statistics   Specialized Subjects

  • 2014   Graduation Research   Specialized Subjects

  • 2014   Graduation Research   Specialized Subjects

  • 2014   Practice in Basic C Programming   Specialized Subjects

  • 2014   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2014   Information Theory   Specialized Subjects

  • 2014   Information Theory   Specialized Subjects

  • 2014   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2014   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2014   Probability and Statistics   Specialized Subjects

  • 2014   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2014   Introductory Seminar   Liberal Arts and Sciences Subjects

  • 2013   Graduation Research   Specialized Subjects

  • 2013   Graduation Research   Specialized Subjects

  • 2013   Practice in Basic C Programming   Specialized Subjects

  • 2013   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2013   Information Theory   Specialized Subjects

  • 2013   Information Theory   Specialized Subjects

  • 2013   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2013   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2013   Probability and Statistics   Specialized Subjects

  • 2013   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2012   Graduation Research   Specialized Subjects

  • 2012   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2012   Introductory Seminar   Liberal Arts and Sciences Subjects

  • 2012   Seminar of Algorithm and Date structureⅠ   Specialized Subjects

  • 2012   Practice in Basic C Programming   Specialized Subjects

  • 2012   Graduation Research   Specialized Subjects

  • 2012   Information Theory   Specialized Subjects

  • 2012   Information Theory   Specialized Subjects

  • 2012   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2012   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2012   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2012   Probability and Statistics   Specialized Subjects

  • 2011   Graduation Research   Specialized Subjects

  • 2011   Independent Study E   Liberal Arts and Sciences Subjects

  • 2011   Seminar of Algorithm and Date structureⅠ   Specialized Subjects

  • 2011   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2011   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2011   Practice in Basic C Programming   Specialized Subjects

  • 2011   Modern Information Technology   Specialized Subjects

  • 2011   Information Theory   Specialized Subjects

  • 2011   Information Theory   Specialized Subjects

  • 2011   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2011   Probability and Statistics   Specialized Subjects

  • 2011   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2010   Introductory Seminar   Liberal Arts and Sciences Subjects

  • 2010   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2010   NA   Specialized Subjects

  • 2010   NA   Specialized Subjects

  • 2010   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2010   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2010   Information Theory   Specialized Subjects

  • 2010   Information Theory   Specialized Subjects

  • 2010   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2009   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2009   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2009   Information Theory   Specialized Subjects

  • 2009   Information Theory   Specialized Subjects

  • 2009   NA   Specialized Subjects

  • 2009   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2009   Graduation Research   Specialized Subjects

  • 2009   Introduction to information science   Liberal Arts and Sciences Subjects

  • 2008   NA   Specialized Subjects

  • 2008   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2008   Computer and Communication Sciences Seminar   Specialized Subjects

  • 2008   NA   Specialized Subjects

  • 2008   Introduction to Computer and Communication Sciences   Specialized Subjects

  • 2008   Graduation Research   Specialized Subjects

  • 2007   Computer and Communication SciencesApplied Experiment   Specialized Subjects

  • 2007   Graduation Research   Specialized Subjects

▼display all

Independent study

  • 2008   C言語によるゲーム制作

  • 2007   Cプログラミング技能向上~基礎の補完

  • 2007   Cプログラミング技能向上~プログラミングの基礎から見直し、自身のプログラミング技術の向上を図る

  • 2007   Cプログラミング技能向上~基礎を一通り理解し応用へつなげる

  • 2007   Cプログラミング技能向上~プログラミング基礎力の向上

  • 2007   Cプログラミング技能向上~基本を身に付ける

▼display all

Classes

  • 2023   Systems Engineering Project SeminarⅡB   Master's Course

  • 2023   Systems Engineering Project SeminarⅡA   Master's Course

  • 2023   Systems Engineering Project SeminarⅠB   Master's Course

  • 2023   Systems Engineering Project SeminarⅠA   Master's Course

  • 2023   Systems Engineering SeminarⅡB   Master's Course

  • 2023   Systems Engineering SeminarⅡA   Master's Course

  • 2023   Systems Engineering SeminarⅠB   Master's Course

  • 2023   Systems Engineering SeminarⅠA   Master's Course

  • 2023   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2023   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2023   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2023   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2023   Systems Engineering Advanced Research   Doctoral Course

  • 2023   Systems Engineering Advanced Research   Doctoral Course

  • 2023   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2023   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2023   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2023   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2022   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2022   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2022   Systems Engineering Advanced Research   Doctoral Course

  • 2022   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2022   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2022   Systems Engineering Project SeminarⅡB   Master's Course

  • 2022   Systems Engineering Project SeminarⅡA   Master's Course

  • 2022   Systems Engineering Project SeminarⅠB   Master's Course

  • 2022   Systems Engineering Project SeminarⅠA   Master's Course

  • 2022   Systems Engineering SeminarⅡB   Master's Course

  • 2022   Systems Engineering SeminarⅡA   Master's Course

  • 2022   Systems Engineering SeminarⅠB   Master's Course

  • 2022   Systems Engineering SeminarⅠA   Master's Course

  • 2021   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Advanced Research   Doctoral Course

  • 2021   Systems Engineering Advanced Research   Doctoral Course

  • 2021   Systems Engineering Advanced Research   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2021   Systems Engineering Project SeminarⅡB   Master's Course

  • 2021   Systems Engineering Project SeminarⅡB   Master's Course

  • 2021   Systems Engineering Project SeminarⅡA   Master's Course

  • 2021   Systems Engineering Project SeminarⅡA   Master's Course

  • 2021   Systems Engineering Project SeminarⅠB   Master's Course

  • 2021   Systems Engineering Project SeminarⅠB   Master's Course

  • 2021   Systems Engineering Project SeminarⅠA   Master's Course

  • 2021   Systems Engineering Project SeminarⅠA   Master's Course

  • 2021   Systems Engineering SeminarⅡB   Master's Course

  • 2021   Systems Engineering SeminarⅡB   Master's Course

  • 2021   Systems Engineering SeminarⅡA   Master's Course

  • 2021   Systems Engineering SeminarⅡA   Master's Course

  • 2021   Systems Engineering SeminarⅠB   Master's Course

  • 2021   Systems Engineering SeminarⅠB   Master's Course

  • 2021   Systems Engineering SeminarⅠA   Master's Course

  • 2021   Systems Engineering SeminarⅠA   Master's Course

  • 2020   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2020   Systems Engineering Global Seminar Ⅰ   Doctoral Course

  • 2020   Systems Engineering Advanced Research   Doctoral Course

  • 2020   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2020   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2020   Systems Engineering Project SeminarⅡB   Master's Course

  • 2020   Systems Engineering Project SeminarⅡA   Master's Course

  • 2020   Systems Engineering Project SeminarⅠB   Master's Course

  • 2020   Systems Engineering Project SeminarⅠA   Master's Course

  • 2020   Systems Engineering SeminarⅡB   Master's Course

  • 2020   Systems Engineering SeminarⅡA   Master's Course

  • 2020   Systems Engineering SeminarⅠB   Master's Course

  • 2020   Systems Engineering SeminarⅠA   Master's Course

  • 2019   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2019   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2019   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2019   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2019   Systems Engineering Advanced Research   Doctoral Course

  • 2019   Systems Engineering Advanced Research   Doctoral Course

  • 2019   Systems Engineering SeminarⅡB   Master's Course

  • 2019   Systems Engineering SeminarⅡA   Master's Course

  • 2019   Systems Engineering SeminarⅠB   Master's Course

  • 2019   Systems Engineering SeminarⅠA   Master's Course

  • 2019   Systems Engineering Global Seminar Ⅱ   Doctoral Course

  • 2019   Systems Engineering Project SeminarⅡB   Master's Course

  • 2019   Systems Engineering Project SeminarⅡA   Master's Course

  • 2019   Systems Engineering Project SeminarⅠB   Master's Course

  • 2019   Systems Engineering Project SeminarⅠA   Master's Course

  • 2018   Systems Engineering Advanced Research   Doctoral Course

  • 2018   Systems Engineering Advanced Research   Doctoral Course

  • 2018   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2018   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2018   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2018   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2018   Systems Engineering Project SeminarⅡB   Master's Course

  • 2018   Systems Engineering Project SeminarⅡA   Master's Course

  • 2018   Systems Engineering Project SeminarⅠB   Master's Course

  • 2018   Systems Engineering Project SeminarⅠA   Master's Course

  • 2018   Systems Engineering SeminarⅡB   Master's Course

  • 2018   Systems Engineering SeminarⅡA   Master's Course

  • 2018   Systems Engineering SeminarⅠB   Master's Course

  • 2018   Systems Engineering SeminarⅠA   Master's Course

  • 2017   Systems Engineering Advanced Research   Doctoral Course

  • 2017   Systems Engineering Advanced Research   Doctoral Course

  • 2017   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2017   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2017   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2017   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2017   Systems Engineering Project SeminarⅡB   Master's Course

  • 2017   Systems Engineering Project SeminarⅡA   Master's Course

  • 2017   Systems Engineering Project SeminarⅠB   Master's Course

  • 2017   Systems Engineering Project SeminarⅠA   Master's Course

  • 2017   Systems Engineering SeminarⅡB   Master's Course

  • 2017   Systems Engineering SeminarⅡA   Master's Course

  • 2017   Systems Engineering SeminarⅠB   Master's Course

  • 2017   Systems Engineering SeminarⅠA   Master's Course

  • 2016   Systems Engineering Advanced Research   Doctoral Course

  • 2016   Systems Engineering Advanced Research   Doctoral Course

  • 2016   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2016   Systems Engineering Advanced Seminar Ⅱ   Doctoral Course

  • 2016   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2016   Systems Engineering Advanced Seminar Ⅰ   Doctoral Course

  • 2016   Systems Engineering Project SeminarⅡB   Master's Course

  • 2016   Systems Engineering Project SeminarⅡA   Master's Course

  • 2016   Systems Engineering Project SeminarⅠB   Master's Course

  • 2016   Systems Engineering Project SeminarⅠA   Master's Course

  • 2016   Systems Engineering SeminarⅡB   Master's Course

  • 2016   Systems Engineering SeminarⅡA   Master's Course

  • 2016   Systems Engineering SeminarⅠB   Master's Course

  • 2016   Systems Engineering SeminarⅠA   Master's Course

  • 2015   Systems Engineering Advanced Seminar Ⅱ  

  • 2015   Systems Engineering Advanced Seminar Ⅰ  

  • 2015   Systems Engineering Advanced Research  

  • 2015   Systems Engineering SeminarⅡA  

  • 2015   Systems Engineering SeminarⅠA  

  • 2015   Systems Engineering Project SeminarⅡA  

  • 2015   Systems Engineering Project SeminarⅠA  

  • 2015   Systems Engineering Advanced Seminar Ⅱ  

  • 2015   Systems Engineering Advanced Seminar Ⅰ  

  • 2015   Systems Engineering Advanced Research  

  • 2015   Systems Engineering SeminarⅡB  

  • 2015   Systems Engineering SeminarⅠB  

  • 2015   Systems Engineering Project SeminarⅡB  

  • 2015   Systems Engineering Project SeminarⅠB  

  • 2014   Systems Engineering Advanced Research  

  • 2014   Systems Engineering Advanced Research  

  • 2014   Systems Engineering Advanced Seminar Ⅱ  

  • 2014   Systems Engineering Advanced Seminar Ⅱ  

  • 2014   Systems Engineering Advanced Seminar Ⅰ  

  • 2014   Systems Engineering Advanced Seminar Ⅰ  

  • 2014   Systems Engineering Project SeminarⅡB  

  • 2014   Systems Engineering Project SeminarⅡA  

  • 2014   Systems Engineering Project SeminarⅠB  

  • 2014   Systems Engineering Project SeminarⅠA  

  • 2014   Systems Engineering SeminarⅡB  

  • 2014   Systems Engineering SeminarⅡA  

  • 2014   Systems Engineering SeminarⅠB  

  • 2014   Systems Engineering SeminarⅠA  

  • 2013   Systems Engineering Advanced Research  

  • 2013   Systems Engineering Advanced Research  

  • 2013   Systems Engineering Advanced Seminar Ⅱ  

  • 2013   Systems Engineering Advanced Seminar Ⅱ  

  • 2013   Systems Engineering Advanced Seminar Ⅰ  

  • 2013   Systems Engineering Advanced Seminar Ⅰ  

  • 2013   Systems Engineering Project SeminarⅡB  

  • 2013   Systems Engineering Project SeminarⅡA  

  • 2013   Systems Engineering Project SeminarⅠB  

  • 2013   Systems Engineering Project SeminarⅠA  

  • 2013   Systems Engineering SeminarⅡB  

  • 2013   Systems Engineering SeminarⅡA  

  • 2013   Systems Engineering SeminarⅠB  

  • 2013   Systems Engineering SeminarⅠA  

  • 2012   Systems Engineering Advanced Seminar Ⅱ  

  • 2012   Systems Engineering Advanced Seminar Ⅰ  

  • 2012   Systems Engineering Advanced Research  

  • 2012   Systems Engineering SeminarⅡA  

  • 2012   Systems Engineering SeminarⅠA  

  • 2012   Systems Engineering Project SeminarⅡA  

  • 2012   Systems Engineering Project SeminarⅠA  

  • 2012   Systems Engineering Advanced Seminar Ⅱ  

  • 2012   Systems Engineering Advanced Seminar Ⅰ  

  • 2012   Systems Engineering Advanced Research  

  • 2012   Systems Engineering SeminarⅡB  

  • 2012   Systems Engineering SeminarⅠB  

  • 2012   Systems Engineering Project SeminarⅡB  

  • 2012   Systems Engineering Project SeminarⅠB  

  • 2011   Systems Engineering Project SeminarⅡB  

  • 2011   Systems Engineering Project SeminarⅡA  

  • 2011   Systems Engineering Project SeminarⅠB  

  • 2011   Systems Engineering Project SeminarⅠA  

  • 2011   Systems Engineering Advanced Research  

  • 2011   Systems Engineering Advanced Research  

  • 2011   NA  

  • 2011   NA  

  • 2011   Systems Engineering Advanced Seminar Ⅱ  

  • 2011   Systems Engineering Advanced Seminar Ⅱ  

  • 2011   Systems Engineering Advanced Seminar Ⅰ  

  • 2011   Systems Engineering Advanced Seminar Ⅰ  

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2010   NA   Master's Course

  • 2009   NA   Master's Course

  • 2009   NA   Master's Course

  • 2009   NA   Master's Course

  • 2009   NA   Master's Course

  • 2008   NA   Master's Course

  • 2008   NA   Master's Course

  • 2008   NA   Master's Course

  • 2008   NA   Master's Course

  • 2007   NA   Master's Course

  • 2007   NA   Master's Course

  • 2007   NA   Master's Course

  • 2007   NA   Master's Course

▼display all

Satellite Courses

  • 2014   Information Science and Technology  

  • 2010   NA  

Research Interests

  • Information Theory

  • Shannon Theory

Published Papers

  • Coding theorems for source coding with cost

    Shigeaki Kuzuoka (Part: Lead author )

    Proc. of 2024 International Symposium on Information Theory and its Applications     446 - 450   2024.11  [Refereed]

  • A study on the joint source-channel coding for computing functions: An approach from a dichotomy of functions

    N. Joki, S. Kuzuoka (Part: Last author )

    Proc. of 2021 IEEE Information Theory Workshop     2021.10  [Refereed]

  • Asynchronous guessing subject to distortion

    Shigeaki Kuzuoka (Part: Lead author )

    Proceedings of 2021 IEEE International Symposium on Information Theory     2008 - 2012   2021.07  [Refereed]

  • A study on the overflow probability of variable-to-fixed length codes

    Shigeaki Kuzuoka (Part: Lead author, Last author, Corresponding author )

    Proc. of 2020 International Symposium on Information Theory and its Applications     26 - 30   2020.10  [Refereed]

  • On the Conditional Smooth Rényi Entropy and its Applications in Guessing and Source Coding

    Shigeaki Kuzuoka (Part: Lead author )

    IEEE Transactions on Information Theory   66 ( 3 ) 1674 - 1690   2020.03  [Refereed]

  • A unified approach to error exponents for multiterminal source coding systems

    Shigeaki Kuzuoka

    IEICE Trans. Fundamentals     2018.12  [Refereed]

  • On Distributed Computing for Functions With Certain Structures

    Shigeaki Kuzuoka, Shun Watanabe

    IEEE TRANSACTIONS ON INFORMATION THEORY ( IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC )  63 ( 11 ) 7003 - 7017   2017.11  [Refereed]

     View Summary

    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, information that is inevitably conveyed to the decoder is identified, and the bound is derived in terms of the optimal rate needed to send that information. The class of informative functions is introduced, and, for the class of smooth sources, the optimal rate for computing those functions is characterized. Furthermore, for sources with joint distribution that may not be full support, functions that are composition of symbol wise function and the type of a sequence are considered, and the optimal rate for computing those functions is characterized in terms of the hypergraph entropy. As a byproduct, our method also provides a conceptually simple proof of the known fact that computing a Boolean function may require as large rate as reproducing the entire source.

    DOI

  • On Distributed Computing for Functions with Certain Structures

    Shigeaki Kuzuoka, Shun Watanabe

    2016 IEEE INFORMATION THEORY WORKSHOP (ITW) ( IEEE )    2016  [Refereed]

     View Summary

    The problem of distributed function computation for the class of smooth sources is studied, where functions to be computed are compositions of symbol-wise functions and some outer functions that are not symbol-wise. The optimal rate for computing those functions is characterized in terms of the Slepian-Wolf rate and an equivalence class of sources induced by functions. To prove the result, a new method to derive a converse bound for distributed computing is proposed; the bound is derived by identifying a source that is inevitably conveyed to the decoder and by explicitly constructing a code for reproducing that source. As a byproduct, it provides a conceptually simple proof of the known fact that computing a Boolean function may require as large rate as reproducing the entire source.

  • Variable-Length Coding for Mixed Sources with Side Information Allowing Decoding Errors

    Shigeaki Kuzuoka

    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) ( IEEE )    161 - 165   2016  [Refereed]

     View Summary

    Variable-length source coding with side information allowing a nonzero decoding error probability epsilon is considered. For the case where the side information is available at both of the encoder and decoder, we give an explicit formula of the rate error function R-c(epsilon) for the mixture of i.i.d. sources. For the case where the side information is available only at the decoder, we concentrate our attention on the mixture of binary symmetric sources. Our result gives a simple way to draw the graph of the rate-error function R(epsilon).

  • The Error Exponent of Zero-Rate Multiterminal Hypothesis Testing for Sources with Common Information

    Makoto Ueda, Shigeaki Kuzuoka (Part: Last author )

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E98A ( 12 ) 2384 - 2392   2015.12  [Refereed]

     View 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 contribution is to prove that Shalaby and Papamarcou's upper bound is valid under a weaker condition: (i) two remote observations have a common random variable in the sense of Gacks and Korner, and (ii) when the value of the common random variable is fixed, the conditional distribution of remaining random variables satisfies the positivity condition. Moreover, a generalization of the main result is also given.

    DOI

  • A Dichotomy of Functions in Distributed Coding: An Information Spectral Approach

    Shigeaki Kuzuoka, Shun Watanabe

    IEEE TRANSACTIONS ON INFORMATION THEORY ( IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC )  61 ( 9 ) 5028 - 5041   2015.09  [Refereed]

     View Summary

    The problem of distributed data compression for function computation is considered, where: 1) the function to be computed is not necessarily symbolwise function and 2) the information source has memory and may not be stationary nor ergodic. We introduce the class of smooth sources and give a sufficient condition on functions so that the achievable rate region for computing coincides with the Slepian-Wolf region (i.e., the rate region for reproducing the entire source) for any smooth sources. Moreover, for symbolwise functions, the necessary and sufficient condition for the coincidence is established. Our result for the full side-information case is a generalization of the result by Ahlswede and Csiszar to sources with memory; our dichotomy theorem is different from Han and Kobayashi's dichotomy theorem, which reveals an effect of memory in distributed function computation. All results are given not only for fixed-length coding but also for variable-length coding in a unified manner. Furthermore, for the full side-information case, the error probability in the moderate deviation regime is also investigated.

    DOI

  • An Information-Spectrum Approach to Weak Variable-Length Source Coding With Side-Information

    Shigeaki Kuzuoka, Shun Watanabe

    IEEE TRANSACTIONS ON INFORMATION THEORY ( IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC )  61 ( 6 ) 3559 - 3573   2015.06  [Refereed]

     View Summary

    This paper studies variable-length (VL) source coding of general sources with side-information. Novel one-shot coding bounds for Slepian-Wolf (SW) coding, which give nonasymptotic tradeoff between the error probability and the codeword length of VL-SW coding, are established. One-shot results are applied to asymptotic analysis, and a general formula for the optimal coding rate achievable by weakly lossless VL-SW coding (i.e., VL-SW coding with vanishing error probability) is derived. Our general formula reveals how the encoder side-information and/or VL coding improve the optimal coding rate in the general setting. In addition, it is shown that if the encoder side-information is useless in weakly lossless VL coding then it is also useless even in the case where the error probability may be positive asymptotically.

    DOI

  • Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

    Shun Watanabe, Shigeaki Kuzuoka, Vincent Y. F. Tan

    IEEE TRANSACTIONS ON INFORMATION THEORY ( IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC )  61 ( 4 ) 1574 - 1605   2015.04  [Refereed]

     View Summary

    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-limited side-information; 2) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder; and 3) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous nonasymptotic bounds on the error probability of the WAK, WZ, and GP problems-in particular those derived by Verdu. Using our novel nonasymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esseen theorem to our new nonasymptotic bounds. Numerical results show that the second-order coding rates obtained using our nonasymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.

    DOI

  • A Dichotomy of Functions in Distributed Coding: An Information Spectral Approach

    Shigeaki Kuzuoka, Shun Watanabe

    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) ( IEEE )    1766 - 1770   2015  [Refereed]

     View Summary

    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 introduce the class of smooth sources and give a sufficient condition on functions so that the achievable rate region for computing coincides with the Slepian-Wolf region (i.e., the rate region for reproducing the entire source) for any smooth sources. Moreover, for symbol-wise functions, the necessary and sufficient condition for the coincidence is established. Our result for the full side-information case is a generalization of the result by Ahlswede and Csiszar; our dichotomy theorem is different from Han and Kobayashi's dichotomy theorem, which reveals an effect of memory in distributed function computation. All results are given not only for fixed-length coding but also for variable-length coding in a unified manner.

  • Universal Wyner-Ziv Coding for Distortion Constrained General Side Information

    Shun Watanabe, Shigeaki Kuzuoka

    IEEE TRANSACTIONS ON INFORMATION THEORY ( IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC )  60 ( 12 ) 7568 - 7583   2014.12  [Refereed]

     View Summary

    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 the distortion between the principal source and side information is smaller than a threshold, but channels may be neither stationary nor ergodic. In this situation, we define a new rate-distortion function as the minimum rate such that there exists a Wyner-Ziv code that is universal for every channel in the class. Then, we show an upper bound and a lower bound on the rate-distortion function, and derive a matching condition such that the upper and lower bounds coincide. The relation between the new rate-distortion function and rate-distortion function of the Heegard-Berger problem is also discussed.

    DOI

  • An Information-Spectrum Approach to Weak Variable-Length Slepian-Wolf Coding

    Shigeaki Kuzuoka, Shun Watanabe

    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) ( IEEE )    2684 - 2688   2014  [Refereed]

     View Summary

    In this paper, we investigate weak variable-length Slepian-Wolf (VL-SW) coding of general sources. First, by using the information-spectrum method, we show novel non-asymptotic trade-off between the error probability and the codeword length of VL-SW coding. Then, we give an asymptotic formula for the optimal coding rate achievable by VL-SW coding. Especially, we investigate VL-SW coding for mixed sources. Our results spotlights the fact that distinguishability between component sources plays an important role in adjusting the coding rate at the encoder. We also demonstrate that our general results derive a known formula for the optimal achievable rate of VL-SW coding for mixture of i.i.d. sources and extend to countably infinite alphabet case with mild condition.

  • Universal Wyner-Ziv coding for distortion constrained general side-information

    Shun Watanabe, Shigeaki Kuzuoka

    IEEE International Symposium on Information Theory - Proceedings     1357 - 1361   2013  [Refereed]

     View Summary

    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 the distortion between the principal source and the side-information is smaller than a threshold, but channels may be neither stationary nor ergodic. In this situation, we define a new rate-distortion function as the minimum rate such that there exists a Wyner-Ziv code that is universal for every channel in the class. Then, we show an upper bound and a lower bound on the rate-distortion function, and derive a matching condition such that the upper and lower bounds coincide. © 2013 IEEE.

    DOI

  • Non-asymptotic and second-order achievability bounds for source coding with side-information

    Shun Watanabe, Shigeaki Kuzuoka, Vincent Y.F. Tan

    IEEE International Symposium on Information Theory - Proceedings     3055 - 3059   2013  [Refereed]

     View Summary

    We present a novel achievability bound for the Wyner-Ahlswede-Körner (WAK) problem of lossless source coding with rate-limited side-information. This bound is proved using ideas from channel simulation and channel resolvability. The bound improves on all previous non-asymptotic bounds on the error probability of the WAK problem. We also present achievable second-order coding rates by applying the multidimensional Berry-Essèen theorem to our new non-asymptotic bound. © 2013 IEEE.

    DOI

  • A Sufficient Condition for the Existence of a Universal Slepian-Wolf Code

    Shigeaki Kuzuoka

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES ( IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG )  E93A ( 7 ) 1355 - 1362   2010.07  [Refereed]

     View Summary

    Universal Slepian-Wolf coding for parametric general sources is considered. Our main result shows that under mild conditions on the family of sources, there exists a universal decoder that attains asymptotically the same random-coding error exponent as the maximum-likelihood decoder.

    DOI

  • Universal Source Coding for Multiple Decoders with Side Information

    Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu

    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY ( IEEE )    1 - 5   2010  [Refereed]

     View Summary

    A multiterminal lossy source 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 attained even if the source statistics are not known.

  • 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.

▼display all

Books etc

  • 情報・符号理論

    楫勇一, 井坂元彦, 岩田賢一, 葛岡成晃( Part: Joint author)

    2013.10 

Misc

  • Universal Coding for Lossless and Lossy Complementary Delivery Problems

    Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu

        2008.02

     View Summary

    This paper deals with a coding problem called complementary delivery, where<br />
    messages from two correlated sources are jointly encoded and each decoder<br />
    reproduces one of two messages using the other message as the side information.<br />
    Both lossless and lossy universal complementary delivery coding schemes are<br />
    investigated. In the lossless case, it is demonstrated that a universal<br />
    complementary delivery code can be constructed by only combining two<br />
    Slepian-Wolf codes. Especially, it is shown that a universal lossless<br />
    complementary delivery code, for which error probability is exponentially<br />
    tight,...

  • Universal Data Compression Algorithm with Side Information Based on LZW Algorithm

    KUZUOKA Shigeaki, UYEMATSU Tomohiko, MATSUMOTO Ryutaroh

    Proceedings of the IEICE General Conference ( The Institute of Electronics, Information and Communication Engineers )  2002   201 - 201   2002.03

Awards & Honors

  • 学術奨励賞

    Winner: 葛岡成晃

    2009.03   電子情報通信学会  

  • 丹羽保次郎記念論文賞

    Winner: 葛岡成晃

    2009.02    

  • Travel Support Award for Young Researchers

    Winner: 葛岡成晃

    2008.12   IEEE IT Society Japan Chapter  

  • SITA奨励賞

    Winner: 葛岡成晃

    2007.12   情報理論とその応用学会  

  • 論文賞

    Winner: 葛岡成晃, 植松友彦

    2007.05   電子情報通信学会  

  • ISITA2002 Paper Award for Young Researchers

    Winner: 葛岡成晃

    2002.10    

▼display all

Conference Activities & Talks

  • Coding theorems for source coding with cost

    Shigeaki Kuzuoka

    SITA2023  2023.11.29  

  • On Guessing and Representation of Integers

    Shigeaki Kuzuoka

    The 2023 Shannon Theory Workshop  2023.10.24  

  • 秘密情報と相関のある公開情報が存在する場合のシャノン暗号システムにおける 推測問題の考察

    大野敦仁, 葛岡成晃

    電子情報通信学会ソサイエティ大会  2023.09  

  • 双方向通信を用いた多端子仮説検定の誤り指数に関する一検討

    柴田正憲, 葛岡成晃

    電子情報通信学会総合大会  2023.03.10  

  • A Study of Computability in Distributed Computing With Joint Source-Channel Coding Over Multiple-Access Channel

    N. Joki, S. Kuzuoka

    The 44th Symposium on Information Theory and its Applications (SITA2021)  2021.12.10  

  • 関数計算のための情報源・通信路結合符号化に関する研究 ~関数の二分法によるアプローチ~

    上木成樹, 葛岡成晃

    電子情報通信学会情報理論研究会  2021.01.21  

  • 3入力関数を計算するための分散符号化法の達成可能領域に関する一検討

    上木成樹, 葛岡成晃

    電子情報通信学会情報理論研究会  2020.05  

  • Guessing -基礎と広がり-

    齋藤翔太, 葛岡成晃

    第42回情報理論とその応用シンポジウム  2019.11  

  • A study on the overflow probability of variable-to-fixed length codes

    Shigeaki Kuzuoka

    42nd Symposium on Information Theory and its Applications  2019.11  

  • Parrondo's Paradox and Entropy Rate

    Shigeaki Kuzuoka

    Shannon Theory Workshop 2019  2019.10  

  • A study on variable-to-fixed length coding of general sources

    Shigeaki Kuzuoka

    IEICE Technical Meeting on Information Theory  2019.09  

  • On the conditional smooth Renyi entropy and its application in guessing

    Shigeaki Kuzuoka

    2019 IEEE International Symposium on Information Theory  2019.07  

  • On overflow probability of variable-to-fixed length codes for non-stationary sources

    Shigeak Kuzuoka

    11th Asia-Europe Workshop on Concepts in Information Theory  2019.07  

  • Properties and applications of the smooth Renyi entropy

    Shigeaki Kuzuoka

    AMS Sectional Meeting  2019.03  

  • On the smooth-Renyi entropy and guessing allowing error

    Shigeaki Kuzuoka

    41st Symposium on Information Theory and its Applications  2018.12  

  • A study on the problem of channel resolvability for channels with countable input alphabet

    Shigeaki Kuzuoka

    2018 International Symposium on Information Theory and its Applications  2018.10  

  • 二元削除通信路の達成可能レートに関する一検討

    桑原弘樹, 葛岡成晃

    電子情報通信学会ソサイエティ大会  2018.09  

  • A study on a variation of the problem of channel resolvability

    Shigeaki Kuzuoka

    Japan-Singapore Workshop on Coding and Information Theory, Singapore  2018.03  

  • A study on a variation of the problem of channel resolvability

    Shigeaki Kuzuoka

    40th Symposium on Information Theory and its Applications  2017.11  

  • On channel resolvability for channels with countable input alphabet

    Shigeaki Kuzuoka

    Shannon Theory Workshop 2017  2017.10  

  • 複合情報源に対する多端子仮説検定の誤り指数に関する研究

    種田博樹, 葛岡成晃

    電子情報通信学会ソサイエティ大会  2017.09  

  • A unified approach to error exponents for multiterminal source coding systems

    Shigeaki Kuzuoka

    2017 IEEE International Symposium on Information Theory  2017.06  

  • On universal FV coding allowing non-vanishing error probability

    Shigeaki Kuzuoka

    10th Asia-Europe Workshop on Information Theory  2017.06  

  • An application of universal FV codes to source coding allowing errors

    Shigeaki Kuzuoka

    IEICE Technical Meeting on Information Theory  2017.05  

  • An application of Iriyama's Lemma for multiterminal source coding systems

    Shigeaki Kuzuoka

    39th Symposium on Information Theory and its Applications  2016.12  

  • Variable-length coding for mixed sources with side information allowing decoding errors

    Shigeaki Kuzuoka

    2016 International Symposium on Information Theory and its Applications  2016.10  

  • On distributed computing for functions with certain structures

    Shigeaki KUzuoka, Shun Watanabe

    2016 IEEE Information Theory Workshop  2016.09  

  • On the smooth Renyi entropy and variable-length source coding allowing errors

    Shigeaki Kuzuoka

    2016 IEEE International Symposium on Information Theory  2016.07  

  • Data Compression for Computing Functions -- An Approach from a Dichotomy of Functions--

    Shigeaki Kuzuoka  [Invited]

    IEICE Technical Meeting on Information Theory  2016.05  

  • On the smooth Renyi entropy and variable-length source coding allowing errors

    Shigeaki Kuzuoka

    38th Symposium on Information Theory and its Applications  2015.12  

  • 相関が未知な補助情報を伴う情報源符号化許容伝送率領域の計算法

    奥田博文, 葛岡成晃

    第38回情報理論とその応用シンポジウム  2015.11  

  • Variable-Length Coding for Mixed Sources with Side Information Allowing Decoding Errors

    Shigeaki Kuzuoka

    Shannon Theory Workshop 2015  2015.09  

  • A dichotomy of functions in distributed coding: An information spectral approach

    Shigeaki Kuzuoka, Shun Watanabe

    2015 IEEE International Symposium on Information Theory  2015.06  

  • An outer bound for achievable rate region for distributed computing

    Shigeaki Kuzuoka, Shun Watanabe

    9th Asia-Europe Workshop on Information Theory  2015.05  

▼display all

KAKENHI

  • ビッグデータ解析のためのデータ圧縮法の開発

    2018.04
    -
    2023.03
     

    Grant-in-Aid for Scientific Research(C)  Principal investigator

  • 論理的に隙のない情報理論テキストの自動生成

    2016.04
    -
    2019.03
     

    Grant-in-Aid for Challenging Exploratory Research  Co-investigator

  • 放送型データ配信のためのユニバーサル可変レートデータ圧縮法の開発

    2014.04
    -
    2018.03
     

    Grant-in-Aid for Young Scientists(B)  Principal investigator

  • モダン符号の形式化

    2013.04
    -
    2016.03
     

    Grant-in-Aid for Scientific Research(B)  Co-investigator

  • センサネットワーク向けのユニバーサルなデータ圧縮法の開発

    2010.04
    -
    2013.03
     

    Grant-in-Aid for Young Scientists(B)  Principal investigator

  • センサネットワーク向けの効率のよいデータ圧縮法の開発

    2007.04
    -
    2009.03
     

    Grant-in-Aid for Young Scientists(Start-up)  Principal investigator

▼display all

Committee member history in academic associations, government agencies, municipalities, etc.

  • 2024年情報理論とその応用国際シンポジウム プログラム委員

    2024.05
    -
    2024.10
     

    2024年情報理論とその応用国際シンポジウム プログラム委員会

     View Details

    学協会、政府、自治体等の公的委員

    国際会議のプログラム委員

  • 電子情報通信学会 基礎・境界ソサイエティ庶務幹事

    2023.06
    -
    2025.05
     

    電子情報通信学会

     View Details

    IEICE ESS

    電子情報通信学会 基礎・境界ソサイエティ 運営委員会の一役職

  • 2023年情報理論とその応用シンポジウム実行委員会総務

    2022.04
    -
    2024.05
     

    2023年情報理論とその応用シンポジウム実行委員会

     View Details

    学協会、政府、自治体等の公的委員

    2023年情報理論とその応用シンポジウムの運営

  • Research Exchange Beyond Information Theory 実行委員

    2022.04
    -
    2023.03
     

    電子情報通信学会

     View Details

    国際会議

    国際会議Research Exchange Beyond Information Theoryの実行委員(Secretary)

  • 電子情報通信学会 基礎・境界ソサイエティ 事業担当幹事

    2021.06
    -
    2023.05
     

    電子情報通信学会

     View Details

    IEICE ESS

    電子情報通信学会 基礎・境界ソサイエティ 運営委員会の一役職

  • 2021 International Conference on Emerging Technologies for Communications TPC 委員

    2021.06
    -
    2021.12
     

    電子情報通信学会

     View Details

    国際会議

    プログラム委員

  • IEICE Communications Express 『Special Cluster in Conjunction with IEICE General Conference 2021』特集編集委員会

    2021.04.16
    -
    Now
     

    電子情報通信学会

     View Details

    論文誌, 編集委員会

    IEICE Communications Express 『Special Cluster in Conjunction with IEICE General Conference 2021』の特集号の編集

  • Communications Express 編集委員

    2020.06
    -
    2024.05
     

    電子情報通信学会

     View Details

    論文誌編集委員

    論文誌編集委員

  • 2020 International Conference on Emerging Technologies for Communications TPC 委員

    2020.06
    -
    2020.12
     

    電子情報通信学会

     View Details

    国際会議

    プログラム委員

  • 電子情報通信学会英文論文誌A 情報理論とその応用小特集号(2021 年12 月号)編集委員

    2020.04
    -
    2021.12
     

    電子情報通信学会

     View Details

    編集委員

    特集号編集委員

▼display all