Based on 3-ary Huffman coding algorithm, we propose a digital mapping method of protein sequence. Firstly, tree is defined by the frequency characteristic 20 amino acids in given sequences. The 0-2 codes constructed can convert long sequences into one-to-one According to and distribution information sequences, design 40-dimensional vectors characterize Next, proposed used perform three separate...

Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of “Yes,” whereas Huffman codewords need not obey this constraint. We bring resolution to this issue, and prove that the average number of questions still lies between H(X) and H(X) + 1.

If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...

Digital Medical Imaging has grown very fast in recent years and hence plays a vital role in diagnosis, treatment, and research area. All the radiological modalities such as CT scanners, MRI, US, PET, X-Ray made by multiple vendors and located at one or many sites can communicate by means of DICOM across an network. Now days, hospitals need to store large volume of data about the patients that r...

Over the centuries, information security has become a major issue. Encryption and decryption of data has recently been widely investigated and developed because there is a demand for a stronger encryption and decryption which is very hard for intrusion. Cryptography plays major roles in fulfilment of these demands. Many of researchers have proposed a lot of encryption and decryption algorithms....

This paper aims to study and compare the compression efficiencies of wavelet-bitmap and wavelet-Huffman. Both methods use wavelet to deduct a portion of the information in the image that can endure losing it without a significant disturbance in the image itself. Both methods deal with thresholding of wavelet coefficients to produce as much as possible zero coefficients for the purpose of higher...

1 1 Abstract—This paper proposes a novel model of the two-level scalar quantizer with extended Huffman coding. It is designed for the average bit rate to approach the source entropy as close as possible provided that the signal to quantization noise ratio (SQNR) value does not decrease more than 1 dB from the optimal SQNR value. Assuming the asymmetry of representation levels for the symmetric ...

This paper describes our recent studies on string pattern matching in compressed texts mainly from practical viewpoints. The aim is to speed up the string pattern matching task, in comparison with an ordinary search over the original texts. We have successfully developed (1) an AC type algorithm for searching in Huffman encoded files, and (2) a KMP type algorithm and (3) a BM type algorithm for...

We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.

Linear shift registers have been extensively studied since the pioneering work of D. A. Huffman. A general theory was created by Huffman, l Golomb, Elspas, Stern, Friedland, Zierler, Hartmannis, Massey, and others. This progress was mainly due to the identification of the operations performed by linear switching circuits with algebraic operations over Galois fields. There was no general theory ...