Jump to contents

Researcher Information

last modified:2024/01/08

Associate Professor FUJISAKI Hiroshi

Mail

Faculty, Affiliation

Faculty of Electrical, Information and Communication Engineering,Institute of Science and Engineering

College and School Educational Field

Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and Technology
Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and Technology
Course in Information and Communication Engineering, School of Electrical, Information and Communication Engineering, College of Science and Engineering

Laboratory

discrete dynamical systems TEL:076-234-4927 FAX:076-234-4913

Academic Background

【Academic background(Doctoral/Master's Degree)】
Kyushu University Doctor Graduate School, Division of Information Systems 199803 Unfinished course

Career

Year & Month of Birth

1966/09

Academic Society



Award

Specialities

Communication/Network engineering、

Speciality Keywords

Research Themes

Generation of a system based on discrete dynamical systems and its application for information-telecommunications

Books

Papers

  •  On Optimum Binary Spreading Sequences of Markov Chains IEE Electronics Letters vol 37 1234-1235 2001/09
  •  Statistical Properties of Real-Valued Sequences of Generated by Chebyshev Maps 数理解析研究所講究録 vol 1240 216-223 2001/12
  •  Kalman's Recognition of Chaotic Dynamics in Desgining Markov Information Sources IEICE Transactions vol E82-A 1747-1753 1999/09
  •  On Variances of MAI Code Average against Data Average ELECTRONICS LETTERS vol 36 1717-1719 2000/09
  •  On Correlation Values of M-Phase Spreading Sequences of Markov Chains Proc. the 24th Symp. On Information Theory and Its Applications vol 1 87-90 2001/12

show all

  •  On Distributions of Auto-correlation Values of Spreading Sequences of Markov Chains Proc. Int. Symp. on Nonlinear Theory and Its Applications vol 2 363-366 2001/11
  •  Optimum 3-phase Spreading Sequences of Markov Chains IEEE Int. Symp. on Circuit and Systems vol V 229-232 2001/05
  •  Statistical Properties of Real-Valued Sequences of Generated by Chebyshev Maps Proc. Int. Symp. on Nonlinear Theory and Its Applications vol 2 351-354 2001/11
  •  Jacobian Elliptic Chebyshev Rational Maps Physica D: Nonlinear Phenomena vol 148 242-254 2000/12
  •  Kalman's Recognition of Chaotic Dynamics in Desgining Markov Information Sources Proc. Int. Symp. on Nonlinear Theory and Its Applications vol II 619-622 1998/09
  •  On an Identification Algorithm of a Markov Chain IEEE Int. Symp. on Information Theory 501 2000/06
  •  On Distribution of Correlational Values of Spreading Sequences Based on Markov Information Sources IEEE Int. Symp. on Circuit and Systems vol V 225-228 2000/05
  •  On Variances of MAI in a DS/CDMA System:Code Average versus Data Average IEEE Int. Symp. on Spread-Spectrum Techniques and Applications vol 2 700-704 2000/09
  •  The Jacobian Elliptic Chebyshev Rational Maps Can Generate Sequences of I.I.D. Random Variables IEEE Int. Symp. on Circuit and Systems vol V 221-224 2000/05
  •  Design of Optimum M-Phase Spreading Sequences of IEICE Trans. on Fundamentals E90-A 10 2055-2065 2007/10
  •  Phase-Shift-Free M-Phase Spreading Sequences of Markov Chains Hayato Sugimori IEEE Trans. on Circuit and Systems Part I 55 3 876-882 2008/03
  •  Large Deviations Analysis of Interference Cancellation for SSMA Communication Systems with Spreading Sequences of Markov Chains Proc. of the IEEE 10th Int. Symp. on Spread-Spectrum Techniques and Applications total 6 pages 2008/08
  •  On Exact Asymptotics of Bit Error Probabilities in SSMA Communication Systems with Spreading Sequences of Markov Chains Proc. of the IEEE 10th Int. Symp. on Spread-Spectrum Techniques and Applications total 6 pages 2008/08
  •  Large Deviations Analysis of SSMA Communication Systems with Spreading Sequences of Markov Chains Proc. of the IEEE Int. Symp. on Information Theory 1383-1387 2008/07
  •  Generating Stochastic Processes Based on the Finitary Interval Algorithm IEICE Trans. on Fundamentals E91-A 9 2482-2488 2008/09
  •  Entropy of the Induced Transformations Associated with the Interval Algorithm Proc. of the IEEE Int. Symp. on Information Theory 2056-2060 2009/06
  •  An Algorithm for Generating All Full-Length Sequences Which Are Based on Discretized Markov Transformations Proc. of the 2009 International Symposium on Nonlinear Theory and its Applications total 4 pages 2009/10
  •  The Central Limit Theorem for the Normalized Sums of the MAI for SSMA Communication Systems Using Spreading Sequences of Markov Chains Gerhard Keller IEICE Trans. on Fundamentals E89-A 9 2307-2314 2006/09
  •  Superiority of Phase-Shift-Free M-Phase Spreading Sequences of Markov Chains Hayato Sugimori Proc. of the IEEE 9th Int. Symp. on Spread-Spectrum Techniques and Applications 108-112 2006/08
  •  On Bit Error Probabilities of SSMA Communication Systems Using Spreading Sequences of Markov Chains Yosuke Yamada IEICE Trans. on Fundamentals E88-A 10  2669-2677 2005/10
  •  Discretized Markov Transformations-An Example of Ultradiscrete Dynamical Systems- IEICE Trans. on Fundamentals E88-A 10 2684-2691 2005/10
  •  The Central Limit Theorem for the Normalized Sums of the Extended Sliding Block Codes from Sequences of Markov Chains with Time Delay Gerhard Keller Proc. the 2nd Int. Workshop on Sequence Design and Its Applications in Communications 98-102 2005/10
  •  Approximations for Bit Error Probabilities in SSMA Communication Systems Using Spreading Sequences of Markov Chains Gerhard Keller Proc. the 2005 IEEE Int. Symp. on Circuit and Systems 872-875 2005/05
  •  Mixing Property for Markov Chains Generating Spreading Sequences Proc. of the 2004 International Symposium on Nonlinear Theory and its Applications 745-748 2004/11
  •  Discretized Markov Transformations-An Example of Ultradiscrete Dynamical Systems- Proc. of the 2004 International Symposium on Nonlinear Theory and its Applications 741-744 2004/11
  •  Approximations for Bit Error Probabilities in SSMA Communication Systems Using Spreading Sequences of Markov Chains Gerhard Keller 2 787-790 2004/12
  •  On Generating Stochastic Processes Based on the Interval Algorithm 1  251-254 2006/11
  •  On embeddings of shifts of finite type into the golden-mean-Dyck shift Proc. of the 2010 International Symposium on Information Theory pp. 583-588 2010/10
  •  On Auto-Correlation Values of de Bruijn Sequences Proc. of the 2010 International Symposium on Nonlinear Theory pp. 414-417 2010/09
  •  An Algorithm for Generating All Full-Length Sequences Which Are Based on Discretized Markov Transformations Nonlinear Theory and Its Applications, IEICE 1 1 pp.166-175 2010/10
  •  Performance Analysis of SSMA Communication Systems with Spreading Sequences of Markov Chains: Large Deviations Principle versus the Central Limit Theorem IEEE Trans. on Information Theory 57 4 1959-1967 2011/04
  •  An algorithm for generating all CR sequences in the de Bruijn sequences of length 2^n where n is any odd number Hiroshi Fujisaki Nonlinear Theory and Its Applications, IEICE 6 2 329-339 2015/04
  •  A construction of all CR sequences in the de Bruijn sequences of length 2^{2p+1} where p is a prime number Hiroshi Fujisaki Nonlinear Theory and Its Applications, IEICE 5 2 235-249 2014/04
  •  On Auto-Correlation Values of de Bruijn Sequences H. Fujisaki, Y. Nabeshima Nonlinear Theory and Its Applications, IEICE 2 4 total 9 pages 2011/10
  •  Entropy of the induced transformations associated with the interval algorithm Hiroshi Fujisaki Nonlinear Theory and Its Applications, IEICE 5 2 127-139 2014/04
  •  Correlational Properties of the Full-Length Sequences Based on the Discretized Markov β-transformations Hiroshi Fujisaki Nonlinear Theory and Its Applications, IEICE 8 1 67-78 2017/01
  •  Correlational Properties of the Full-Length Sequences Based on the Discretized Markov Transformations Proc. of the 2016 International Symposium on Information Theory pp. 637-641 2016/11
  •  On the topological entropy of the discretized Markov β-transformations IEICE Trans. on Fundamentals E99-A 12 2238-2247 2016/12
  •  Enumeration of Both-Ends-Fixed k-ary Necklaces and Its Applications Hiroshi Fujisaki IEICE Trans. on Fundamentals E106-A no.3 431-439 2023/03
  •  Enumeration of Both-Ends-Fixed k-ary Necklaces and Its Applications Hiroshi Fujisaki IEICE Technical Report IT2021-48 107-112 2022/01
  •  Improvement of Cicalese-Gargano-Vaccaro Algorithm for the Minimum-Entropy Couplings Problem Kohei Sakatani, Ken-ichi Iwata, and Hiroshi Fujisaki IT2020-151 239-244 2021/03
  •  On irreducibility of the stream version of asymmetric binary systems Hiroshi Fujisaki IEICE Trans. on Fundamentals E163-A 5 757-768 2020/05
  •  Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization Yuta Sakai, Ken-ichi Iwata, and Hiroshi Fujisaki IEEE Trans. on Information Theory 66 7 3976-4006 2020/07
  •  A Simple Construction of the Full-Length Binary Sequences Based on the Discretized Markov β-Transformations and Their Correlational Properties Hiroshi Fujisaki 388-392 2019/11
  •  Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki 2109-2113 2019/07
  •  On Irreducibility of the Stream Version of the Asymmetric Binary Systems Hiroshi Fujisaki 218-222 2018/12
  •  Invariant Measures for the Subshifts Associated with the Asymmetric Binary Hiroshi Fujisaki Proc. of the 2018 International Symposium on Information Theory pp. 675-679 2018/10
  •  Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki 856-850 2018/06
  •  Concrete Examples of Countably Infinite Multilevel Source Polarization with a Certain Infinite Group 206–211 2018/12

Conference Presentations

Others

Arts and Fieldwork

Patent

Theme to the desired joint research

Grant-in-Aid for Scientific Research

○「ビット誤り率に関するM相スペクトル拡散符号の最適設計」(2004-) 
○「超離散力学系に基づく最適拡散符号の実現とその応用」(2009-) 
○「非線型力学系に基づく最適拡散符号の実現,最適ファミリーの構成と応用」(2012-2014) 

Competitive research funding,Contribution

Collaborative research,Consignment study

Classes (Bachelors)

○Theory of Fourier Analysis and Exercise(2019)
○Linear Algebra 1(2019)
○Introduction to Dynamical Systems A(2019)
○Introduction to Dynamical Systems B(2019)
○Linear Algebra 1(2019)
○Linear Algebra 1(2019)
○Linear Algebra 1(2019)
○Linear Algebra 1(2018)
○Linear Algebra 1(2018)
○Theory of Fourier Analysis and Exercise(2018)
○Introduction to Dynamical Systems A(2018)
○Introduction to Dynamical Systems B(2018)
○Linear Algebra 1(2017)
○Linear Algebra 1(2017)
○Theory of Fourier Analysis and Exercise(2017)
○Introduction to Dynamical Systems(2017)
○Theory of Complex Analysis and Exercise(2017)
○Theory of Complex Analysis and Exercise(2017)
○Theory of Complex Analysis and Exercise(2016)
○Theory of Complex Analysis and Exercise(2016)
○Theory of Complex Analysis and Exercise(2016)
○Linear Algebra 1(2016)
○Linear Algebra 1(2016)
○Theory of Fourier Analysis and Exercise(2016)
○Introduction to Dynamical Systems(2016)

Classes (Graduate Schools)

○Symbolic Dynamics and Its Applications(2019)
○Symbolic Dynamics and Its Applications(2019)
○Symbolic Dynamics and Its Applications(2019)
○Symbolic Dynamics and Its Applications(2019)
○An Introduction to Discrete Dynamical Systems(2019)
○Symbolic Dynamics and Its Applications(2018)
○Symbolic Dynamics and Its Applications(2018)
○Symbolic Dynamics and Its Applications(2018)
○Symbolic Dynamics and Its Applications(2018)
○An Introduction to Discrete Dynamical Systems(2018)
○Symbolic Dynamics and Its Applications(2017)
○Symbolic Dynamics and Its Applications(2017)
○Symbolic Dynamics and Its Applications(2017)
○Symbolic Dynamics and Its Applications(2017)
○An Introduction to Discrete Dynamical Systems(2017)
○Symbolic Dynamics and Its Applications(2016)
○An Introduction to Discrete Dynamical Systems(2016)

International Project

International Students

Lecture themes

Others (Social Activities)

To Page Top