Properties of k-bit Delay Decodable Codes
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2023
- DOI:
- 10.48550/arXiv.2306.07563
- arXiv:
- arXiv:2306.07563
- Bibcode:
- 2023arXiv230607563H
- Keywords:
-
- Computer Science - Information Theory