The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encodings present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In prior work, we have proposed an arbitrary-precision technique to adapt bit recycling to arithmetic code instead of Huffman code. We have shown that...
Tunstall proposed an efficient algorithm for constructing the optimal dictionary of any particular size to obtain a variable-to-fixed code. More accurately, the algorithm constructs the optimal uniquely parsable dictionary. In fact, Savari showed that, if one allows herself to consider plurally parsable dictionaries, better codes may be constructed. Savari found a class of plurally parsable dictionaries...
Donald Knuth published an efficient algorithm for constructing a code with balanced codewords. A balanced codeword is a codeword that contains an equal number of zero's and one's. The redundancy of the codes built using Knuth's algorithm is about twice the lower bound on redundancy. In this paper we propose a new scheme based on the bit recycling compression technique to reduce Knuth's algorithm redundancy...
The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encoding feature present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In this paper, we propose to adapt bit recycling to arithmetic code instead of Huffman code. This adaptation enables bit recycling to achieve...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.