Almost Instantaneous Fixed-to-Variable Length Codes

被引：22

作者：

Yamamoto, Hirosuke

Tsuchihashi, Masato ^{[2
]}

Honda, Junya ^{[1
]}

机构：

[1] Univ Tokyo, Dept Complex Sci & Engn, Chiba 2778561, Japan

[2] Univ Tokyo, Dept Math Informat, Tokyo 1138656, Japan

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2015年 / 61卷 / 12期

基金：

日本学术振兴会;

关键词：

AIFV code; Huffman code; FV code; code tree; Kraft inequality; integer programming;

D O I：

10.1109/TIT.2015.2492961

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose almost instantaneous fixed-to-variable length (AIFV) codes such that two (resp. K - 1) code trees are used, if code symbols are binary (resp. K-ary for K >= 3), and source symbols are assigned to incomplete internal nodes in addition to leaves. Although the AIFV codes are not instantaneous codes, they are devised such that the decoding delay is at most two bits (resp. one code symbol) in the case of binary (resp. K-ary) code alphabet. The AIFV code can attain better average compression rate than the Huffman code at the expenses of a little decoding delay and a little large memory size to store multiple code trees. We also show for the binary and ternary AIFV codes that the optimal AIFV code can be obtained by solving 0-1 integer programming problems.

引用

页码：6432 / 6443

页数：12

共 50 条

[1] General Form of Almost Instantaneous Fixed-to-Variable-Length Codes
Sugiura, Ryosuke
Kamamoto, Yutaka
Moriya, Takehiro
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (12) : 7672 - 7690
[2] VARIABLE-TO-FIXED LENGTH CODES ARE BETTER THAN FIXED-TO-VARIABLE LENGTH CODES FOR MARKOV SOURCES
ZIV, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 861 - 863
[3] On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
Nomura, Ryo
Matsushima, Toshiyasu
[J]. 2010 DATA COMPRESSION CONFERENCE (DCC 2010), 2010, : 548 - 548
[4] Fixed-to-variable length source coding using turbo codes
Haghighat, Javad
Hamouda, Walaa
Soleymani, M. Reza
[J]. 2006 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, 2006, : 215 - 219
[5] On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
Nomura, Ryo
Matsushima, Toshiyasu
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (11) : 2083 - 2091
[6] VARIABLE-TO-FIXED LENGTH CODES PROVIDE BETTER LARGE DEVIATIONS PERFORMANCE THAN FIXED-TO-VARIABLE LENGTH CODES
MERHAV, N
NEUHOFF, DL
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) : 135 - 140
[7] Fixed-to-Variable Length Distribution Matching
Amjad, Rana Ali
Boecherer, Georg
[J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1511 - 1515
[8] Fixed-to-Variable Length Resolution Coding for Target Distributions
Boecherer, Georg
Amjad, Rana Ali
[J]. 2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
[9] VARIABLE-TO-FIXED LENGTH CODES ARE BETTER THAN FIXED-TO-VARIABLE LENGTH CODES FOR MARKOV SOURCES (IEEE TRANS INFORM THEORY, VOL 36, P 861, 1990)
ZIV, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) : 312 - 312
[10] Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes
Dube, Danny
Haddad, Fatma
[J]. 2018 DATA COMPRESSION CONFERENCE (DCC 2018), 2018, : 405 - 405

← 1 2 3 4 5 →