Summary

The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)

2018

Session Number:We-AM-Poster

Session:

Number:We-AM-Poster.6

Enumeration of Compact Trees of AIFV Codes

Kengo Hashimoto,  Ken-ichi Iwata,  Hirosuke Yamamoto,  

pp.496-496

Publication Date:2018/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.55.We-AM-Poster.6

PDF download

PayPerView

Summary:
We enumerate the number of compact code trees in the class of AIFV (almost instantaneous fixed-to-variable length) codes, each of which is represented by a pair of code trees (T0, T1).