A-6-5 A Lower Bound on the Codeword Length of Grammar Based Codes

スポンサーリンク

概要

• 論文の詳細を見る

• This paper reveals that the compression rate of any grammar based code is lower bounded by one-half of the compression rate of a variation of LZ77 code.

• 社団法人電子情報通信学会の論文
• 2008-09-02

著者

• Kuzuoka Shigeaki

  Wakayama Univ. Wakayama‐shi Jpn

関連論文

• Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
• Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
• Universal source coding for complementary delivery
• A-6-9 On the Suboptimality of Linear Lossy Codes
• A-6-5 A Lower Bound on the Codeword Length of Grammar Based Codes

スポンサーリンク