IEICE TRANSACTIONS on Fundamentals
Properties of k-Bit Delay Decodable Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E107-A No.3 pp.417-447
- Publication Date
- 2024/03/01
- Publicized
- 2023/09/07
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2023TAP0016
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding and Data Compression
Authors
Kengo HASHIMOTO
University of Fukui
Ken-ichi IWATA
University of Fukui
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kengo HASHIMOTO, Ken-ichi IWATA, "Properties of k-Bit Delay Decodable Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E107-A, no. 3, pp. 417-447, March 2024, doi: 10.1587/transfun.2023TAP0016.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023TAP0016/_p
Copy
@ARTICLE{e107-a_3_417,
author={Kengo HASHIMOTO, Ken-ichi IWATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Properties of k-Bit Delay Decodable Codes},
year={2024},
volume={E107-A},
number={3},
pages={417-447},
abstract={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.},
keywords={},
doi={10.1587/transfun.2023TAP0016},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Properties of k-Bit Delay Decodable Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 417
EP - 447
AU - Kengo HASHIMOTO
AU - Ken-ichi IWATA
PY - 2024
DO - 10.1587/transfun.2023TAP0016
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E107-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2024
AB - 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.
ER -
English
