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

Research on the theory and applications of AIFV codes and their variants

Research Project

Project/Area Number 18H01436
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Review Section Basic Section 21020:Communication and network engineering-related
Research InstitutionThe University of Tokyo

Principal Investigator

Yamamoto Hirosuke  東京大学, 大学院新領域創成科学研究科, 名誉教授 (30136212)

Co-Investigator(Kenkyū-buntansha) 岩田 賢一  福井大学, 学術研究院工学系部門, 准教授 (80284313)
阪井 和男  明治大学, 法学部, 専任教授 (50225752)
Project Period (FY) 2018-04-01 – 2023-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥15,600,000 (Direct Cost: ¥12,000,000、Indirect Cost: ¥3,600,000)
Fiscal Year 2022: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2021: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2020: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2019: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2018: ¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Keywords準瞬時FV符号 / AIFV符号 / AIVF符号 / 無歪みデータ圧縮 / 繰返し最適化手法 / 通信路-情報源同時符号化アルファベッティク符号 / アルファベッティクAIFV符号 / 動的AIFV符号 / 準瞬時符号 / データ圧縮 / 情報源符号化 / 情報理論 / 準瞬時FV符号 (AIFV符号) / 準瞬時VF符号 (AIVF符号) / 情報源符号 / 準瞬時VF符号 / 準舜時FV符号 / 準舜時VF符号 / 繰り返し最適化手法 / データ圧縮符号 / ユニバーサル符号 / LZW符号 / 平均性能最適化 / 繰り返し最適化
Outline of Final Research Achievements

Concerning AIFV (Almost Instantaneous Fixed-to-Variable Length) codes, we obtained the following results. An iterative algorithm to construct to construct an optimal AIFV code for a given source and the proof of the optimality of the algorithm. Construction and evaluation of a dynamic AIFV codes. Construction and evaluation of alphabetic AIFV codes. Enumeration and coding of AIFV code trees. Evaluation of the worst case redundancy of AIFV-m codes. Construction and evaluation of a universal code based on AIVF codes. Construction and evaluation of an optimal binary alphabetic AIFV-m code. Joint coding for a finite discrete source and a finite state noiseless channel based on the AIFV coding strategy. Construction and evaluation of an AIFV code with 2-bit decoding delay and unequal bit costs.

Academic Significance and Societal Importance of the Research Achievements

ハフマン符号は平均符号長を最小にする最適な符号として知られていたが、準瞬時FV(AIFV)符号では複数の符号木を同時に使うことで、ハフマン符号よりさらに短い平均符号長を達成することができる。本研究ではAIFV符号の最適な構成法やAIFV符号の拡張法(動的符号, アルファベッティック符号, ユニバーサル符号, 情報源と通信路の同時符号化, 符号語ビットが不均一コストを持つ場合符号化など)を示すことで、それらの従来知られていた符号よりもさらに小さい平均符号長を達成できることを明らかにした。これらの符号を利用することで,さまざまな通信システムや記録システムの符号化効率を改善することができる。

Report

(6 results)
  • 2023 Final Research Report ( PDF )
  • 2022 Annual Research Report
  • 2021 Annual Research Report
  • 2020 Annual Research Report
  • 2019 Annual Research Report
  • 2018 Annual Research Report
  • Research Products

    (25 results)

All 2024 2023 2022 2021 2020 2019 2018

All Journal Article (12 results) (of which Peer Reviewed: 10 results) Presentation (13 results) (of which Int'l Joint Research: 1 results,  Invited: 1 results)

  • [Journal Article] AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost2024

    • Author(s)
      Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, Hirosuke Yamamoto,
    • Journal Title

      Proceedings of 2024 IEEE International Symposium on Information Theory

      Volume: 1

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Joint Coding for Discrete Sources and Finite-State Noiseless Channels2022

    • Author(s)
      Iwata Ken-Ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2022 IEEE International Symposium on Information Theory

      Volume: - Pages: 3327-3332

    • DOI

      10.1109/isit50566.2022.9834437

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] AIVF Codes Based on Iterative Algorithm and Dynamic Programming2021

    • Author(s)
      Iwata Ken-ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2021 IEEE International Symposium on Information Theory (ISIT2021)

      Volume: 1 Pages: 2018-2023

    • DOI

      10.1109/isit45174.2021.9518033

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes2021

    • Author(s)
      Iwata Ken-ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2020 IEEE Information Theory Workshop (ITW2020)

      Volume: 1 Pages: 261-265

    • DOI

      10.1109/itw46852.2021.9457572

    • Related Report
      2021 Annual Research Report 2020 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 準瞬時FV符号(AIFV符号)─ハフマン符号に勝る圧縮率を達成する符号─2021

    • Author(s)
      山本博資
    • Journal Title

      電子情報通信学会誌

      Volume: 104 Pages: 35-42

    • NAID

      40022455335

    • Related Report
      2020 Annual Research Report
  • [Journal Article] A Universal Data Compression Scheme based on the AIVF Coding Techniques2020

    • Author(s)
      Yamamoto Hirosuke、Imaeda Koki、Hashimoto Kengo、Iwata Ken-ichi
    • Journal Title

      Proceedings of 2020 IEEE International Symposium on Information Theory (ISIT2020)

      Volume: 1 Pages: 2378-2382

    • DOI

      10.1109/isit44484.2020.9173982

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On a Redundancy of AIFV-m Codes for m =3,52020

    • Author(s)
      Fujita Ryusei、Iwata Ken-ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2020 IEEE International Symposium on Information Theory (ISIT2020)

      Volume: 1 Pages: 2373-2377

    • DOI

      10.1109/isit44484.2020.9174219

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States2019

    • Author(s)
      Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto
    • Journal Title

      Proceedings of International Sympoium on Information Theory

      Volume: 1 Pages: 1902-1906

    • DOI

      10.1109/isit.2019.8849856

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration and Coding of Compact Code Trees for Binary AIFV Codes2019

    • Author(s)
      Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto
    • Journal Title

      Proceedings of International Sympoium on Information Theory

      Volume: 1 Pages: 1527-1531

    • DOI

      10.1109/isit.2019.8849775

    • Related Report
      2019 Annual Research Report
  • [Journal Article] An Optimality Proof of the Iterative Algorithm for AIFV-m Codes2018

    • Author(s)
      Fujita Ryusei、Iwata Ken-Ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2018 IEEE International Symposium on Information Theory

      Volume: 1 Pages: 2187-2191

    • DOI

      10.1109/isit.2018.8437861

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Alphabetic AIFV Codes Constructed from Hu-Tucker codes2018

    • Author(s)
      Tomotaka Hiraoka, Hirosuke Yamamoto
    • Journal Title

      Proceedings of 2018 IEEE International Symposium on Information Theory

      Volume: 1 Pages: 2182-2186

    • DOI

      10.1109/isit.2018.8437915

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Dynamic AIFV Coding2018

    • Author(s)
      Tomotaka HIRAOKA, Hirosuke YAMAMOTO
    • Journal Title

      Proceedings of 2018 International Symposium on Information Theory and Its Applicaitons

      Volume: 1 Pages: 577-581

    • DOI

      10.23919/isita.2018.8664267

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Presentation] Nビットの復号遅延を許容するアルファベティック符号の構成法2023

    • Author(s)
      植田大智,岩田 賢一,山本 博資
    • Organizer
      電子情報通信学会情報理論研究会技術報告
    • Related Report
      2022 Annual Research Report
  • [Presentation] 符号ビットのコストを考慮した2ビットの復号遅延を許容するAIFV符号2023

    • Author(s)
      若山貴洋,橋本健吾,岩田 賢一,山本 博資
    • Organizer
      第46回情報理論とその応用シンポジウム(SITA2023)
    • Related Report
      2022 Annual Research Report
  • [Presentation] 3ビットの復号遅延を許容するアルファベティック符号の構成法2022

    • Author(s)
      植田大智,岩田 賢一,山本 博資
    • Organizer
      第45回情報理論とその応用シンポジウム(SITA2022)
    • Related Report
      2022 Annual Research Report
  • [Presentation] 2元AIFV-m符号の最悪冗長度が1/mである予想の反例と改良2021

    • Author(s)
      中村優太,植田大智,岩田賢一,山本博資
    • Organizer
      電子情報通信学会技術報告(情報理論研究会)
    • Related Report
      2020 Annual Research Report
  • [Presentation] AIFV-m符号の冗長度について ~ m=3,5の場合 ~2020

    • Author(s)
      藤田龍星,岩田賢一,山本博資
    • Organizer
      電子情報通信学会技術報告(情報理論研究会)
    • Related Report
      2020 Annual Research Report
  • [Presentation] AIFV符号の構成法および有限マルコフ状態における平均性能の最適化法2020

    • Author(s)
      岩田賢一,藤田龍星,山本博資
    • Organizer
      電子情報通信学会技術報告(フォトニックネットワーク研究会)
    • Related Report
      2020 Annual Research Report
    • Invited
  • [Presentation] 2元AIFV-m符号における符号木の列挙と符号化2020

    • Author(s)
      大西源太,橋本健吾,岩田賢一,山本博資
    • Organizer
      電子情報通信学会技術報告(情報理論研究会)
    • Related Report
      2020 Annual Research Report
  • [Presentation] AIFV符号化テクニックに基づくユニバーサルデータ圧縮符号2019

    • Author(s)
      山本博資,橋本健吾, 今枝弘貴, 岩田賢一
    • Organizer
      第11回シャノン理論ワークショップ
    • Related Report
      2019 Annual Research Report
  • [Presentation] 平均性能最適化の繰り返しアルゴリズムによるAIVF符号の改良2019

    • Author(s)
      牧野楓也, 藤田龍星, 岩田賢一, Danny Dube;, 山本博資
    • Organizer
      第42回情報理論とその応用シンポジウム
    • Related Report
      2019 Annual Research Report
  • [Presentation] Enumeration of Compact Trees of AIFV codes2018

    • Author(s)
      K.Hashimoto, K.Iwata, and H.Yamamoto
    • Organizer
      International Symposium on Information Theory and Its Applications
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 不均一コストに対する2元AIFV符号の簡易構成法2018

    • Author(s)
      吉田崇裕, 山本博資
    • Organizer
      電子情報通信学会情報理論研究会
    • Related Report
      2018 Annual Research Report
  • [Presentation] 元AIFV符号におけるコンパクト符号木の列挙と符号化2018

    • Author(s)
      橋本健吾, 岩田賢一, 山本博資
    • Organizer
      第41回情報理論とその応用シンポジウム
    • Related Report
      2018 Annual Research Report
  • [Presentation] 最適な2元AIFV-m符号の構成法の実装例2018

    • Author(s)
      河井貴哉, 藤田龍星,橋本健吾, 岩田賢一, 山本博資
    • Organizer
      第41回情報理論とその応用シンポジウム
    • Related Report
      2018 Annual Research Report

URL: 

Published: 2018-04-23   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi