A Theoretical Analysis and Designing of Universal Code for Sources and Channels with Sufficient Statistic

• Project/Area Number: 20760250
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: Communication/Network engineering
• Research Institution: Shonan Institute of Technology
• Principal Investigator: ARIMURA Mitsuharu 湘南工科大学, 工学部, 講師 (80313427)
• Project Period (FY): 2008 – 2011
• Project Status: Completed (Fiscal Year 2011)
• Budget Amount: ¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000); Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2009: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
• Keywords: 情報理論 / データ圧縮 / 情報源符号化 / ユニバーサル符号 / 情報スペクトル理論 / 十分統計量 / VF符号 / FF符号 / 無歪みデータ圧縮 / タンストール符号 / 一般情報源 / 個別冗長度 / 可算アルファベット / 有歪みデータ圧縮 / 通信路符号化

Research Abstract

In this research, some theoretical performance analysis of variable-to-fixed length source codes have been done, and insights about fixed-to-fixed length source coding are obtained. One of the main results is that a new criterion to analyze the compression performance of the Tunstall code is presented, and using this criterion, the Tunstall code is proved to be asymptotically optimal for stationary and memoryless sources.

Research Products

• [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources (2010)
  • Author(s): Mitsuharu Arimura
  • Journal Title: IEICE Trans. Fundamentals Volume: Vol.E93-A, No.11 Pages: 1904-1911
  • NAID: 10027984382
  • Peer Reviewed
• [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources (2010)
  • Author(s): Mitsuharu Arimura
  • Journal Title: IEICE Trans. Fundamentals Vol.E93-A Pages: 1904-1911
  • NAID: 10027984382
  • Peer Reviewed
• [Journal Article] On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources (2010)
  • Author(s): Mitsuharu Arimura
  • Journal Title: IEICE Transactions on Fundamentals Volume: E93-A Pages: 1904-1911
  • NAID: 10027984382
  • Peer Reviewed
• [Presentation] Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Sources (2011)
  • 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
• [Presentation] Lossless Data Compression via Substring Enumerationにおけるある改良 (2011)
  • Author(s): 嶋優希, 岩田賢一, 有村光晴
  • Organizer: 電子情報通信学会技術研究報告
  • Place of Presentation: 大阪市立大学
  • Year and Date: 2011-05-20
• [Presentation] Lossless Data Compression via Substring Enumerationにおけるある改良 (2011)
  • Author(s): 嶋優希, 岩田賢一, 有村光晴
  • Organizer: 電子情報通信学会情報理論研究会
  • Place of Presentation: 大阪市立大学
  • Year and Date: 2011-05-20
• [Presentation] An Improvement in Lossless Data Compression via Substring Enumeration (2011)
  • 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
• [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度 (2011)
  • Author(s): 古賀弘樹, 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会 情報通信基礎サブソサイエティ合同研究会
  • Place of Presentation: 大阪大学,大阪府
  • Year and Date: 2011-03-03
• [Presentation] Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Source (2011)
  • 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
• [Presentation] An Improvement in Lossless Data Compression via Substring Enumeration (2011)
  • 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
• [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度 (2011)
  • Author(s): 古賀弘樹, 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告
  • Place of Presentation: 大阪大学
• [Presentation] 情報スペクトルの幅と固定長符号化の最悪冗長度 (2011)
  • Author(s): 古賀弘樹, 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告No.IT-2010-83, pp.93-98
  • Place of Presentation: 大阪大学
• [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources (2010)
  • 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
• [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources (2010)
  • Author(s): Mitsuharu Arimura, Ken-ichi Iwata
  • Organizer: 第33回情報理論とその応用シンポジウム(SITA2010)
  • Place of Presentation: 松代,長野県
  • Year and Date: 2010-12-01
• [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources (2010)
  • 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
• [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会 情報理論研究会
  • Place of Presentation: 工学院大学,東京都
  • Year and Date: 2010-07-22
• [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources (2010)
  • 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
• [Presentation] 一般情報源に対するFF符号およびVF符号の冗長度レートについて (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会情報理論研究会
  • Place of Presentation: 信州大学
  • Year and Date: 2010-03-05
• [Presentation] A Converse Coding Theorem for Variable-to-Fixed Length Source Coding of General Sources (2010)
  • 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
• [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources (2010)
  • 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
• [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告
  • Place of Presentation: 工学院大学
• [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources (2010)
  • Author(s): Mitsuharu Arimura and Ken-ichi Iwata
  • Organizer: Proc. 2010 IEEE International Symposium on Information Theory(ISIT2010)
  • Place of Presentation: Austin, USA
• [Presentation] 一般情報源に対するFF符号およびVF符号の冗長度レートについて (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告
  • Place of Presentation: 信州大学
• [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度 (2010)
  • Author(s): 有村光晴
  • Organizer: 第32回情報理論とその応用シンポジウム(SITA2009)
  • Place of Presentation: 山口県山口市
• [Presentation] The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Code for General Sources (2010)
  • 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
• [Presentation] 一般情報源に対する無歪みFF符号の最小達成可能冗長度レート (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告,No.IT2010-21, pp.57-62
  • Place of Presentation: 工学院大学
• [Presentation] On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources, Proc (2010)
  • 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
• [Presentation] 一般情報源に対するFF 符号およびVF 符号の冗長度レートについて (2010)
  • Author(s): 有村光晴, 岩田賢一
  • Organizer: 電子情報通信学会技術研究報告,No.IT2009-136, pp.413-418
  • Place of Presentation: 信州大学
• [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度 (2009)
  • Author(s): 有村光晴
  • Organizer: 情報理論とその応用シンポジウム
  • Place of Presentation: 山口県湯田温泉
  • Year and Date: 2009-12-03
• [Presentation] 定常無記憶情報源に対するTunstall符号の個別冗長度 (2009)
  • Author(s): 有村光晴
  • Organizer: 第32回情報理論とその応用シンポジウム(SITA2009)予稿集,pp.619-624
  • Place of Presentation: 山口県山口市湯田温泉
• [Book] 情報理論 (2008)
  • Author(s): 白木善尚, 村松純, 岩田賢一, 有村光晴, 渋谷智治
  • Publisher: オーム社
• [Book] 情報理論(渋谷智治著) (2008)
  • Author(s): 白木善尚編, 村松純, 岩田賢一, 有村光晴
  • Publisher: オーム社