Title :
Housekeeping for prefix coding
Author :
Turpin, Andrew ; Moffat, Alistair
Author_Institution :
Dept. of Comput. Sci. & Software Eng., Melbourne Univ., Parkville, Vic., Australia
fDate :
4/1/2000 12:00:00 AM
Abstract :
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 of the same magnitude as m, the length of the message being coded. The proposed structures are of direct relevance in applications that mimic one-pass operation through the use of semistatic compression on a block-by-block basis
Keywords :
Huffman codes; adaptive codes; block codes; data compression; source coding; 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; Application software; Communications Society; Computer science; Cost function; Decoding; Encoding; Frequency; Huffman coding; Software engineering; Throughput;
Journal_Title :
Communications, IEEE Transactions on
