Open AccessBidirectional Huffman Coding
Author(s) -
Aviezri S. Fraenkel
Publication year - 1990
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/33.4.296
Subject(s) - huffman coding , computer science , artificial intelligence , data compression
Under what conditions can Huffman codes be efficiently decoded in bothdirections? The usual decoding procedure works also for backward decodingonly if the code has the affix property, i.e., both prefix and suffix properties.Some affix Huffman codes are exhibited, and necessary conditions for the existenceof such codes are given. An algorithm is presented which, for a givenset of codeword lengths, constructs an affix code, if there exists one. Since formany distributions there is no...
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom