40 search results - page 4 / 8 » Reserved-Length Prefix Coding |
DCC
1996
IEEE
13 years 11 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
JSAC
2008
13 years 7 months ago
2008
This paper is concerned with the low-cost iterative equalization/detection principles for coded linear systems with cyclic prefixes. Turbo frequency-domain-equalization (FDE) is ap...
TIT
2008
13 years 7 months ago
2008
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A novel lossless source coding paradigm applies to problems in which a vital message needs to be transmitted prior to termination of communications, as in Alfr