3 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Reduction of Sufficient Number of Code Tables of -Bit Delay Decodable Codes
Kengo Hashimoto, Ken-ichi Iwata
A -bit delay decodable code-tuple is a lossless source code that can achieve a smaller average codeword length than Huffman codes by using a finite number of code tables and all…
The Optimality of AIFV Codes in the Class of -bit Delay Decodable Codes
Kengo Hashimoto, Ken-ichi Iwata
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-varian…
Properties of k-bit Delay Decodable Codes
Kengo Hashimoto, Ken-ichi Iwata
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 p…
Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes
Kengo Hashimoto, Ken-ichi Iwata
For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code…
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory
A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama +24
This year, 2019 we celebrate 30 years of our friendship between Asian and European scientists at the AEW11 in Rotterdam, the Netherlands. Many of the 1989 participants are also pre…