Results 1  10
of
223,878
Boosting Text Compression with Wordbased Statistical Encoding
"... Semistatic wordbased byteoriented compressors are known to be attractive alternatives to compress natural language texts. With compression ratios around 3035%, they allow fast direct searching of compressed text. In this article we reveal that these compressors have even more benefits. We show th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
from our preprocessing step. They achieve much better space and time performance when indexing is preceded by a compression step. Apart from using the wellknown Tagged Huffman code, we present a new suffixfree DenseCodebased compressor that compresses slightly better. We also show how some self
Huffman Coding with NonSorted Frequencies
"... Abstract. A standard way of implementing Huffman’s optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may ..."
Abstract
 Add to MetaCart
Abstract. A standard way of implementing Huffman’s optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may
Is Huffman Coding Dead?
 COMPUTING
, 1993
"... In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance
Bidirectional Huffman Coding
, 1989
"... Under what conditions can Huffman codes be efficiently decoded in both directions? The usual decoding procedure works also for backward decoding only 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 ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
affix Huffman codes is presented, and its worst case complexity is proved to be linear in the length of the encoded text. 1. Introduction For a given sequence of n weights w 1 ; : : : ; wn , with w i ? 0, Huffman's wellknown algorithm [9] constructs an optimum prefix code. We use throughout the term
Tight Bounds on the Redundancy of Huffman Codes
 Proc. of IEEE ITW
, 2006
"... Consider a discrete finite source with N symbols, and with the probability distribution p: = (u1, u2,..., uN). It is wellknown that the Huffman encoding algorithm [1] provides an optimal prefix code for this source. A Dary Huffman ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Consider a discrete finite source with N symbols, and with the probability distribution p: = (u1, u2,..., uN). It is wellknown that the Huffman encoding algorithm [1] provides an optimal prefix code for this source. A Dary Huffman
A Quantum Analog of Huffman Coding
 IEEE International Symposium on Information Theory
, 1998
"... We analyse a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. However, for the storage of quantum information, we have succeeded in constructing a Huffmancoding inspired quantum scheme. The nu ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
and DiVincenzo of the wellknown quantum noiseless block coding scheme by Schumacher. The powers and limitations in using this scheme in communication are also discussed. I.
Is Huffman Coding Dead?
, 1993
"... In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is ..."
Abstract
 Add to MetaCart
In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance
CP and Modified Huffman Technique
"... A lossless compression algorithm, for genetic sequences, based on two phase, 1st phase searching for exact R2CP is reported. The compression results obtained in the algorithm show that the exact R2CP are one of the main hidden regularities in DNA sequences. The proposed DNA sequence compression alg ..."
Abstract
 Add to MetaCart
A lossless compression algorithm, for genetic sequences, based on two phase, 1st phase searching for exact R2CP is reported. The compression results obtained in the algorithm show that the exact R2CP are one of the main hidden regularities in DNA sequences. The proposed DNA sequence compression algorithm is based on R2CP substring and creates online Library file acting as a Look Up Table. The R2CP substring is replaced by corresponding ASCII character. Information security is the most challenging question to protect the data from piracy. This proposed method may protect the data from hackers. For better security purpose we have introduced a new security technique in 2nd phase that is selection encryption method. In this technique the data are encrypted either in the Look Up table or in compressed file or in both. It can also
On the redundancy achieved by Huffman codes
, 1995
"... It has been recently proved that the redundancy r of any discrete memoryless source satisfies r # 1 ,H#p N #, where p N is the least likely source letter probability. This bound is achieved only by sources consisting of two letters. We prove a ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
It has been recently proved that the redundancy r of any discrete memoryless source satisfies r # 1 ,H#p N #, where p N is the least likely source letter probability. This bound is achieved only by sources consisting of two letters. We prove a
Algorithms for Updating Huffman Codes
"... Abstract: Given a list W = [w1,…, wn] of n positive symbol weights, and a list L = [l1,…,ln] of n corresponding integer codeword lengths, it is required to find the new list L when a new value x is inserted in or when an existing value is deleted from the list of weights W. The presented algorithm ..."
Abstract
 Add to MetaCart
uses the given information about the weights and their corresponding levels in order to perform the required update. No other knowledge about the original Huffman Tree is assumed to be known. Instead of rebuilding the Huffman Tree, the new algorithm redistributes the weights among the levels to obtain
Results 1  10
of
223,878