Properties of k-Bit Delay Decodable Codes

被引：2

作者：

Hashimoto, Kengo ^{[1
]}

Iwata, Ken-Ichi ^{[1
]}

机构：

[1] Univ Fukui, Fukui 9108507, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2024年 / E107A卷 / 03期

关键词：

data compression; source coding; decoding delay; BINARY AIFV CODES;

D O I：

10.1587/transfun.2023TAP0016

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The class of k -bit delay decodable codes, source codes allowing decoding delay of at most k bits for k >= 0, can attain a shorter average codeword length than Huffman codes. This paper discusses the general properties of the class of k -bit delay decodable codes with a finite number of code tables and proves two theorems which enable us to limit the scope of codes to be considered when discussing optimal k -bit delay decodable codes.

引用

页码：417 / 447

页数：31

共 25 条

[1]

Fujita R, 2020, IEEE INT SYMP INFO, P2355, DOI 10.1109/ISIT44484.2020.9174219

[2]

Fujita R, 2019, IEEE INT SYMP INFO, P1902, DOI [10.1109/isit.2019.8849856, 10.1109/ISIT.2019.8849856]

[3]

Fujita R, 2018, IEEE INT SYMP INFO, P2187, DOI 10.1109/ISIT.2018.8437861

[4]

Golin M. J., 2022, PROC IEEE INT S INFO, P282

[5]

Golin M, 2020, Arxiv, DOI arXiv:2001.11170

[6] Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries [J].

Golin, Mordecai ;

Harb, Elfarouk .

THEORETICAL COMPUTER SCIENCE, 2021, 865 :99-118

[7] Polynomial Time Algorithms for Constructing Optimal AIFV Codes [J].

Golin, Mordecai ;

Harb, Elfarouk .

2019 DATA COMPRESSION CONFERENCE (DCC), 2019, :231-240

[8]

Hashimoto K, 2023, Arxiv, DOI arXiv:2306.09671

[9]

Hashimoto K, 2022, Arxiv, DOI [arXiv:2209.08874, 10.1109/JSAIT.2022.3230745, DOI 10.1109/JSAIT.2022.3230745]

[10] On the Optimality of Binary AIFV Codes with Two Code Trees [J].

Hashimoto, Kengo ;

Iwata, Ken-ichi .

2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, :3173-3178

← 1 2 3 →