تقرير
The Optimality of AIFV Codes in the Class of $2$-bit Delay Decodable Codes
| العنوان: | The Optimality of AIFV Codes in the Class of $2$-bit Delay Decodable Codes |
|---|---|
| المؤلفون: | Hashimoto, Kengo, Iwata, Ken-ichi |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Information Theory |
| الوصف: | AIFV (almost instantaneous fixed-to-variable length) codes are noiseless source codes that can attain a shorter average codeword length than Huffman codes by allowing a time-variant encoder with two code tables and a decoding delay of at most 2 bits. First, we consider a general class of noiseless source codes, called k-bit delay decodable codes, in which one allows a finite number of code tables and a decoding delay of at most k bits for k >= 0. Then we prove that AIFV codes achieve the optimal average codeword length in the 2-bit delay decodable codes class. Comment: arXiv admin note: substantial text overlap with arXiv:2306.07563 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2306.09671 |
| رقم الأكسشن: | edsarx.2306.09671 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |