Housekeeping for prefix coding.

Housekeeping for prefix coding.

We consider the problem of constructing and transmitting the prelude for Huffman (1952) coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when S, the size of the source alphabet, is...

全面介紹

書目詳細資料
發表在:IEEE Transactions on communications 48, 4 (2000).
主要作者: Turpin, A.
格式: Article
語言:English
主題:
Huffman coding.
Canonical minimum-redundancy coding.
Message length.
One-pass operation.
Prefix coding.
Prelude construction.
Prelude representation.
Prelude transmission.
Pseudoadaptive block coder.
Semistatic coding.
Semistatic compression.
Source alphabet size.
Source coding.