Properties of k-bit Delay Decodable Codes

2023/06/13 by Hashimoto, Kengo, Iwata, Ken-ichi
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2306.07563

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.

Related

• Reduction of Sufficient Number of Code Tables of k-Bit Delay Decodable Codes
• Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes
• The Optimality of AIFV Codes in the Class of 2-bit Delay Decodable Codes
• Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes
• Minimum Delay Huffman Code in Backward Decoding Procedure