Properties of k-bit Delay Decodable Codes
Information Theory
2023-06-14 v1 math.IT
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 code-tuples to be considered when discussing optimal k-bit delay decodable code-tuples.
Keywords
Cite
@article{arxiv.2306.07563,
title = {Properties of k-bit Delay Decodable Codes},
author = {Kengo Hashimoto and Ken-ichi Iwata},
journal= {arXiv preprint arXiv:2306.07563},
year = {2023}
}