• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

ARIMURA Mitsuharu  有村 光晴

ORCIDConnect your ORCID iD *help
… Alternative Names

有村 光晴  アリムラ ミツハル

Less
Researcher Number 80313427
Other IDs
External Links
Affiliation (based on the past Project Information) *help 2023 – 2024: 湘南工科大学, 情報学部, 講師
2022: 湘南工科大学, 工学部, 講師
2004 – 2017: 湘南工科大学, 工学部, 講師
2000 – 2001: 電気通信大学, 大学院・情報システム学研究科, 助手
Review Section/Research Field
Principal Investigator
Communication/Network engineering / Basic Section 60010:Theory of informatics-related / Fundamental theory of informatics / 情報システム学(含情報図書館学)
Except Principal Investigator
Basic Section 60070:Information security-related / Communication/Network engineering
Keywords
Principal Investigator
十分統計量 / 無歪みデータ圧縮 / 情報理論 / データ圧縮 / VF符号 / ユニバーサル符号 / 情報源符号化 / 個別冗長度 / 一般情報源 / タンストール符号 … More / FF符号 / 情報スペクトル理論 / Lempel-Ziv符号 / 逐次仮説検定 / 統計的推定 / 逐次仮設検定 / VF符号 / MPM符号 / ユニバーサルデータ圧縮 / 符号化レート / 冗長度 / 通信路符号化 / 有歪みデータ圧縮 / 可算アルファベット / ユニバーサル性 / 最尤推定量 / 文脈自由文法 / 形式言語理論 / ユニバーサル符号化 / ソート法 / Move-To-Front法 / ブロックソート法 … More
Except Principal Investigator
識別不可能性 / 安全性評価 / 公開鍵暗号 / 情報セキュリティ / 反辞書法 / Move-To-Front法 / 多分木 / スプレイ / 木符号 / 乱数検定 / T-code / 放送型暗号 / Complexity / T-Code / 暗号システム / データ圧縮 / 同期系列 / 一般情報源 / FV 符号 / 符号木 Less
  • Research Projects

    (8 results)
  • Research Products

    (72 results)
  • Co-Researchers

    (10 People)
  •  計算論および統計学にもとづく文字列の複雑度・類似度の定義とその情報理論的解析Principal Investigator

    • Principal Investigator
      有村 光晴
    • Project Period (FY)
      2024 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Shonan Institute of Technology
  •  公開鍵暗号の識別不可能性に対する総合的評価技術の開発

    • Principal Investigator
      四方 順司
    • Project Period (FY)
      2022 – 2025
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60070:Information security-related
    • Research Institution
      Yokohama National University
  •  Analyses and design of variable-to-fixed length data compression algorithms focused on the relationship with the sequentially hypothesis testing and the sufficient statisticPrincipal Investigator

    • Principal Investigator
      Arimura Mitsuharu
    • Project Period (FY)
      2015 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Communication/Network engineering
    • Research Institution
      Shonan Institute of Technology
  •  Theoretical Analysis and Design of Universal VF Code Based on Sufficient Statistic and Pointwise RedundancyPrincipal Investigator

    • Principal Investigator
      ARIMURA Mitsuharu
    • Project Period (FY)
      2012 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Communication/Network engineering
    • Research Institution
      Shonan Institute of Technology
  •  A Theoretical Analysis and Designing of Universal Code for Sources and Channels with Sufficient StatisticPrincipal Investigator

    • Principal Investigator
      ARIMURA Mitsuharu
    • Project Period (FY)
      2008 – 2011
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Communication/Network engineering
    • Research Institution
      Shonan Institute of Technology
  •  Analysis of Coding Tree Characteristics and its Applications to Data Compression and Cryptosystems

    • Principal Investigator
      YAMAMOTO Hirosuke
    • Project Period (FY)
      2005 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Communication/Network engineering
    • Research Institution
      The University of Tokyo
  •  形式言語理論および十分統計量を用いたデータ圧縮の設計法に関する研究Principal Investigator

    • Principal Investigator
      有村 光晴
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Shonan Institute of Technology
  •  ユニバーサルデータ圧縮の理論解析および高精細画像符号化への応用に関する研究Principal Investigator

    • Principal Investigator
      有村 光晴
    • Project Period (FY)
      2000 – 2001
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      情報システム学(含情報図書館学)
    • Research Institution
      The University of Electro-Communications

All 2023 2022 2018 2016 2015 2014 2013 2011 2010 2009 2008 2005 2004 Other

All Journal Article Presentation Book

  • [Book] 情報理論(渋谷智治著)2008

    • Author(s)
      白木善尚編, 村松純, 岩田賢一, 有村光晴
    • Publisher
      オーム社
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Book] 情報理論2008

    • Author(s)
      白木善尚, 村松純, 岩田賢一, 有村光晴, 渋谷智治
    • Publisher
      オーム社
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Journal Article] LZ78符号とそのバリエーションを用いた文法圧縮の構成2023

    • Author(s)
      有村光晴
    • Journal Title

      電子情報通信学会, 信学技報

      Volume: 122, 427 Pages: 224-229

    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Journal Article] (3,1)反復符号の復号法に関するバリエーション2023

    • Author(s)
      有村光晴
    • Journal Title

      第46回情報理論とその応用シンポジウム予稿集

      Volume: - Pages: 362-367

    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Journal Article] 文脈を用いるLZ78符号と文脈を用いないLZ78符号のコルモゴロフ複雑度の視点からの比較2022

    • Author(s)
      有村光晴
    • Journal Title

      第45回情報理論とその応用シンポジウム(SITA2022)予稿集

      Volume: - Pages: 133-138

    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Journal Article] A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions2018

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Transactions on Fundamentals

      Volume: E101.A Pages: 249-258

    • NAID

      130006300874

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Journal Article] Lossless Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources with a Finite Alphabet2016

    • Author(s)
      Ken-ichi Iwata and Mitsuharu Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E99.A Issue: 12 Pages: 2130-2135

    • DOI

      10.1587/transfun.E99.A.2130

    • NAID

      130005170493

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Journal Article] Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence2016

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E99.A Issue: 12 Pages: 2281-2285

    • DOI

      10.1587/transfun.E99.A.2281

    • NAID

      130005170510

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Journal Article] Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources2015

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E98.A Issue: 12 Pages: 2393-2406

    • DOI

      10.1587/transfun.E98.A.2393

    • NAID

      130005112015

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Journal Article] Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources2014

    • Author(s)
      Ken-ichi Iwata, Mitsuharu Arimura and Yuki Shima
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E97.A Issue: 8 Pages: 1754-1760

    • DOI

      10.1587/transfun.E97.A.1754

    • NAID

      130004679259

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Journal Article] A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code2013

    • Author(s)
      Mitsuharu Arimura, Hiroki Koga and Ken-ichi Iwata
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E96.A Issue: 12 Pages: 2443-2446

    • DOI

      10.1587/transfun.E96.A.2443

    • NAID

      130003385294

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Journal Article] Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes2013

    • Author(s)
      Mitsuharu Arimura, Hiroki Koga and Ken-ichi Iwata
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E96.A Issue: 12 Pages: 2332-2342

    • DOI

      10.1587/transfun.E96.A.2332

    • NAID

      130003385281

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources2010

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: Vol.E93-A, No.11 Pages: 1904-1911

    • NAID

      10027984382

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources2010

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Transactions on Fundamentals

      Volume: E93-A Pages: 1904-1911

    • NAID

      10027984382

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources2010

    • Author(s)
      Mitsuharu Arimura
    • Journal Title

      IEICE Trans. Fundamentals Vol.E93-A

      Pages: 1904-1911

    • NAID

      10027984382

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Journal Article] Asymptotic Redundancy of the MTP Scheme for Stationary Ergodic Sources2005

    • Author(s)
      Mitsuharu Arimura, Hirosuke Yamamoto
    • Journal Title

      IEEE Transactions on Information Theory 51・11

      Pages: 3742-3752

    • Data Source
      KAKENHI-PROJECT-17360174
  • [Journal Article] An Extension of Asymptotically Sufficient Statistic Method for Pointwise Strong Universality2005

    • Author(s)
      Mitsuharu Arimura, Hiroshi Nagaoka
    • Journal Title

      Proc.2005 IEEE International Symposium on Information Theory (ISIT2005)

      Pages: 505-509

    • Data Source
      KAKENHI-PROJECT-16700008
  • [Journal Article] ユニバーサルデータ圧縮と十分統計量2005

    • Author(s)
      有村光晴
    • Journal Title

      湘南工科大学紀要 第39巻・第1号

      Pages: 73-80

    • NAID

      110001078986

    • Data Source
      KAKENHI-PROJECT-16700008
  • [Journal Article] 漸近十分統計量を用いたFV情報源符号の冗長度解析2005

    • Author(s)
      有村光晴, 長岡浩司
    • Journal Title

      第3回シャノン理論ワークショップ予稿集(STW05)

      Pages: 41-48

    • Data Source
      KAKENHI-PROJECT-16700008
  • [Journal Article] Asymptotically Sufficient Statistic Method for Evaluation of Pointwise Redundancy of FV Source Codes2004

    • Author(s)
      Mitsuharu Arimura, Hiroshi Nagaoka
    • Journal Title

      Proc.2004 International Symposium on Information Theory and Its Applications

      Pages: 769-774

    • Data Source
      KAKENHI-PROJECT-16700008
  • [Journal Article] 十分統計量と強ユニバーサル情報源符号化2004

    • Author(s)
      有村光晴, 長岡浩司
    • Journal Title

      第27回情報理論とその応用シンポジウム予稿集

      Pages: 155-158

    • NAID

      10014280394

    • Data Source
      KAKENHI-PROJECT-16700008
  • [Presentation] LZ78符号とそのバリエーションを用いた文法圧縮の構成2023

    • Author(s)
      有村光晴
    • Organizer
      電子情報通信学会, RCC・ISEC・IT・WBS合同研究会
    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Presentation] (3,1)反復符号の復号法に関するバリエーション2023

    • Author(s)
      有村光晴
    • Organizer
      第46回情報理論とその応用シンポジウム(SITA2023)
    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Presentation] A Class of Data Compression Where the Codeword Is a Computer Program Generating the Data2022

    • Author(s)
      Mitsuharu Arimura
    • Organizer
      2022 International Symposium on Information Theory and its Applications (ISITA2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Presentation] 文脈を用いるLZ78符号と文脈を用いないLZ78符号のコルモゴロフ複雑度の視点からの比較2022

    • Author(s)
      有村光晴
    • Organizer
      第45回情報理論とその応用シンポジウム(SITA2022)
    • Data Source
      KAKENHI-PROJECT-23K24846
  • [Presentation] 情報源近似と漸近十分統計量を用いた強ユニバーサルFV符号の最悪冗長度の評価2018

    • Author(s)
      有村光晴, 長岡浩司
    • Organizer
      電子情報通信学会情報理論研究会
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] VF符号から抽出される漸近十分統計量を用いた二段階VVユニバーサル符号の構築2016

    • Author(s)
      有村光晴, 長岡浩司
    • Organizer
      電子情報通信学会情報理論研究会
    • Place of Presentation
      北海道小樽市 小樽経済センター
    • Year and Date
      2016-05-19
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] A Grammar-Based Compression Using a Variation of Chomsky Normal Form of Context Free Grammar2016

    • Author(s)
      Mitsuharu Arimura
    • Organizer
      2016 International Symposium on Information Theory and its Applications (ISITA2016)
    • Place of Presentation
      Monterey, CA, USA
    • Year and Date
      2016-10-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] A Variable-to-Fixed Length Lossless Source Code Optimizing a Different Criterion of Average Coding Rate from Tunstall Code2016

    • Author(s)
      Mitsuharu Arimura
    • Organizer
      2016 International Symposium on Information Theory and its Applications (ISITA2016)
    • Place of Presentation
      Monterey, CA, USA
    • Year and Date
      2016-10-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] A Two-Step Universal VV Code Using an Asymptotically Sufficient Statistic Extracted from a VF Code2016

    • Author(s)
      Mitsuharu Arimura and Hiroshi Nagaoka
    • Organizer
      2016 International Symposium on Information Theory and its Applications (ISITA2016)
    • Place of Presentation
      Monterey, CA, USA
    • Year and Date
      2016-10-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] 文脈自由文法のチョムスキー標準形を用いた文法圧縮アルゴリズム2016

    • Author(s)
      有村光晴
    • Organizer
      電子情報通信学会情報理論研究会
    • Place of Presentation
      北海道小樽市 小樽経済センター
    • Year and Date
      2016-05-19
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] 十分統計量とVF符号のユニバーサル性の関係2015

    • Author(s)
      有村光晴
    • Organizer
      第38回情報理論とその応用シンポジウム (SITA2015)
    • Place of Presentation
      岡山県倉敷市下電ホテル
    • Year and Date
      2015-11-24
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] 任意の分割木系列に対するmulti-shot Tunstall符号の平均符号化レート2015

    • Author(s)
      有村光晴
    • Organizer
      第38回情報理論とその応用シンポジウム (SITA2015)
    • Place of Presentation
      岡山県倉敷市下電ホテル
    • Year and Date
      2015-11-24
    • Data Source
      KAKENHI-PROJECT-15K06088
  • [Presentation] 多値アルファベット版部分列数え上げデータ圧縮法に対する最悪冗長度2014

    • Author(s)
      岩田賢一, 有村光晴
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      名古屋大学
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Sources2011

    • Author(s)
      Hiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      2011 IEEE International Symposium on Information Theory (ISIT2011)
    • Place of Presentation
      Saint Petersberg, Russia
    • Year and Date
      2011-08-02
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] Lossless Data Compression via Substring Enumerationにおけるある改良2011

    • Author(s)
      嶋優希, 岩田賢一, 有村光晴
    • Organizer
      電子情報通信学会情報理論研究会
    • Place of Presentation
      大阪市立大学
    • Year and Date
      2011-05-20
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] Lossless Data Compression via Substring Enumerationにおけるある改良2011

    • Author(s)
      嶋優希, 岩田賢一, 有村光晴
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      大阪市立大学
    • Year and Date
      2011-05-20
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度2011

    • Author(s)
      古賀弘樹, 有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会 情報通信基礎サブソサイエティ合同研究会
    • Place of Presentation
      大阪大学,大阪府
    • Year and Date
      2011-03-03
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度2011

    • Author(s)
      古賀弘樹, 有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      大阪大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] An Improvement in Lossless Data Compression via Substring Enumeration2011

    • Author(s)
      Ken-ichi Iwata and Mitsuharu Arimura
    • Organizer
      Proc. 10^<th> IEEE/ACS International Conference on Computer and Information Science(ICIS2011)
    • Place of Presentation
      Sanya, Hainan Island, China
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度2011

    • Author(s)
      古賀弘樹, 有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告No.IT-2010-83, pp.93-98
    • Place of Presentation
      大阪大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] An Improvement in Lossless Data Compression via Substring Enumeration2011

    • Author(s)
      Ken-ichi Iwata, Mitsuharu Arimura
    • Organizer
      10th IEEE/ACS International Conference on Computer and Information Science (ICIS2011)
    • Place of Presentation
      Hainan Island, China
    • Year and Date
      2011-05-17
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Source2011

    • Author(s)
      Hiroki Koga, Mitsuharu Arimura, and Ken-ichi Iwata
    • Organizer
      Proc. 2011 IEEE International Symposium on Information Theory(ISIT2011)
    • Place of Presentation
      Saint Petersberg, Russia
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources2010

    • Author(s)
      Mitsuharu Arimura and Ken-ichi Iwata
    • Organizer
      Proc. of the 33^<rd> Symposium on Information Theory and its Applications(SITA2010)
    • Place of Presentation
      Matsushiro, Nagano, Japan
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      2010 IEEE International Symposium on Information Theory (ISIT2010)
    • Place of Presentation
      Austin, TX, USA
    • Year and Date
      2010-06-15
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      工学院大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告,No.IT2010-21, pp.57-62
    • Place of Presentation
      工学院大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対するFF符号およびVF符号の冗長度レートについて2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      信州大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      工学院大学,東京都
    • Year and Date
      2010-07-22
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      第33回情報理論とその応用シンポジウム(SITA2010)
    • Place of Presentation
      松代,長野県
    • Year and Date
      2010-12-01
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対するFF符号およびVF符号の冗長度レートについて2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会情報理論研究会
    • Place of Presentation
      信州大学
    • Year and Date
      2010-03-05
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度2010

    • Author(s)
      有村光晴
    • Organizer
      第32回情報理論とその応用シンポジウム(SITA2009)
    • Place of Presentation
      山口県山口市
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      Proc. the 33rd Symposium on Information Theory and its Applications (SITA2010), pp.349-352
    • Place of Presentation
      Matsushiro, Nagano, Japan, Nov
    • Year and Date
      2010-12-01
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources, Proc2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      2010 IEEE International Symposium on Information Theory (ISIT2010), pp.126-130
    • Place of Presentation
      Austin, TX, USA
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources2010

    • Author(s)
      Mitsuharu Arimura and Ken-ichi Iwata
    • Organizer
      Proc. 2010 International Symposium on Information Theory and its Applications(ISITA2010)
    • Place of Presentation
      Taichung, Taiwan
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Code for General Sources2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      Proc. 2010 International Symposium on Information Theory and its Applications (ISITA2010), pp.595-600
    • Place of Presentation
      Taichung, Taiwan
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources2010

    • Author(s)
      Mitsuharu Arimura, Ken-ichi Iwata
    • Organizer
      2010 International Symposium on Information Theory and its Applications (ISITA2010)
    • Place of Presentation
      Taichung, Taiwan
    • Year and Date
      2010-10-19
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources2010

    • Author(s)
      Mitsuharu Arimura and Ken-ichi Iwata
    • Organizer
      Proc. 2010 IEEE International Symposium on Information Theory(ISIT2010)
    • Place of Presentation
      Austin, USA
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 一般情報源に対するFF 符号およびVF 符号の冗長度レートについて2010

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会技術研究報告,No.IT2009-136, pp.413-418
    • Place of Presentation
      信州大学
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度2009

    • Author(s)
      有村光晴
    • Organizer
      情報理論とその応用シンポジウム
    • Place of Presentation
      山口県湯田温泉
    • Year and Date
      2009-12-03
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度2009

    • Author(s)
      有村光晴
    • Organizer
      第32回情報理論とその応用シンポジウム(SITA2009)予稿集,pp.619-624
    • Place of Presentation
      山口県山口市湯田温泉
    • Data Source
      KAKENHI-PROJECT-20760250
  • [Presentation] 平均個別符号化レートが最適なVF符号

    • Author(s)
      有村光晴
    • Organizer
      第37回情報理論とその応用シンポジウム(SITA2014)予稿集
    • Place of Presentation
      富山県黒部市
    • Year and Date
      2014-12-09 – 2014-12-12
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] 冗長度と符号化レートの両方で最適なFF符号

    • Author(s)
      有村光晴,古賀弘樹,岩田賢一
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] FF符号における冗長度と符号化レートの関係について

    • Author(s)
      有村光晴,古賀弘樹,岩田賢一
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      飯塚市
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] On the Coding Rate of a Multishot Tunstall Code for Stationary Memoryless Sources

    • Author(s)
      Mitsuharu Arimura
    • Organizer
      Proc. 2014 International Symposium on Information Theory and its Applications (ISITA2014)
    • Place of Presentation
      Melbourne, Australia
    • Year and Date
      2014-10-26 – 2014-10-29
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] On Variable-to-Fixed Length Coding of a General Source with Infinite Alphabet

    • Author(s)
      Mitsuharu Arimura and Ken-ichi Iwata
    • Organizer
      2012 International Symposium on Information Theory and its Applications (ISITA2012)
    • Place of Presentation
      Honolulu, Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] On the Maximum Redundancy of CSE for I.I.D. Sources

    • Author(s)
      Ken-ichi Iwata, Mitsuharu Arimura and Yuki Shima
    • Organizer
      2012 International Symposium on Information Theory and its Applications (ISITA2012)
    • Place of Presentation
      Honolulu, Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] Lossless Data Compression via Substring Enumerationのマルコフ情報源に対する最悪冗長度

    • Author(s)
      岩田賢一,有村光晴,嶋優希
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      関西学院大学
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] Relationships between the Classes of the Redundancy-Optimal and the Rate-Optimal FF Codes for a General Source

    • Author(s)
      Mitsuharu Arimura, Hiroki Koga and Ken-ichi Iwata
    • Organizer
      The 8th Asian-European Workshop on Information Theory
    • Place of Presentation
      Kamakura, Kanagawa, JAPAN
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] Multishot Tunstall符号の定常無記憶情報源に対する概収束符号化定理

    • Author(s)
      有村光晴
    • Organizer
      第37回情報理論とその応用シンポジウム(SITA2014)予稿集
    • Place of Presentation
      富山県黒部市
    • Year and Date
      2014-12-09 – 2014-12-12
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] 可算無限アルファベットの情報源に対してVF符号が存在する条件

    • Author(s)
      有村光晴, 岩田賢一
    • Organizer
      電子情報通信学会 情報理論研究会
    • Place of Presentation
      福井県あわら市
    • Data Source
      KAKENHI-PROJECT-24560482
  • [Presentation] 平均個別符号化レートが最適なVF符号とTunstall符号の比較

    • Author(s)
      有村光晴
    • Organizer
      第37回情報理論とその応用シンポジウム(SITA2014)予稿集
    • Place of Presentation
      富山県黒部市
    • Year and Date
      2014-12-09 – 2014-12-12
    • Data Source
      KAKENHI-PROJECT-24560482
  • 1.  KOGA Hiroki (20272388)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 2.  YAMAMOTO Hirosuke (30136212)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 3.  小川 朋宏 (00323527)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 4.  四方 順司 (30345483)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 5.  岩本 貢 (50377016)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 6.  白川 真一 (90633272)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  HAMANO Kenji
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  TANGUCHI Elliot
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  SUIMON Yoshiyuki
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  TASHIRO Yusuke
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi