Iterative decoding of JPEG images does not perform well due to the poor distance property of the original JPEG Huffman codes. We propose a symmetric RVLC with large free distance which can dramatically improve the system performance when iterative decoding is performed. Simulation results indicate up to 4 dB coding gain is achievable. There is a significant body of literature (see references in...

Two approaches to reducing effort in switch-based text entry for augmentative and alternative communication devices are word prediction and efficient coding schemes, such as Huffman. However, character distributions that inform the latter have never accounted for the use of the former. In this paper, we provide the first combination of Huffman codes and word prediction, using both trigram and l...

An example of application of the wavelet transform to electrocardiography is described in the paper. The transform is exploited as a first stage of an ECG signal compression algorithm. The signal is decomposed into particular time-frequency components. Some of the components are removed because of their low influence to signal shape due to nonstationary character of ECG. Resulted components are...

This paper describes the first steps towards a minimum-size phrase table implementation to be used for phrase-based statistical machine translation. The focus lies on the size reduction of target language data in a phrase table. Rank Encoding (REnc), a novel method for the compression of word-aligned target language in phrase tables is presented. Combined with Huffman coding a relative size red...

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...

Minimum-redundancy prefix codes have been a mainstay of research and commercial compression systems since their discovery by David Huffman more than 50 years ago. In this experimental evaluation we compare techniques for decoding minimum-redundancy codes, and quantify the relative benefits of recently developed restricted codes that are designed to accelerate the decoding process. We find that ...