Sciweavers

2621 search results - page 43 / 525
» Near orders and codes
Sort
View
DCC
2008
IEEE
14 years 9 months ago
Huffman Coding with Non-sorted 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 inves...
Shmuel Tomi Klein, Dana Shapira
ICIP
2001
IEEE
14 years 11 months ago
Rate-distortion unequal error protection for fractal image codes
Fractal image codes are very sensitive to bit errors because the decoding of a block is dependent not only on the code information associated to this block but also on the code in...
Vladimir Stankovic, Dietmar Saupe, Raouf Hamzaoui
TIT
2010
70views Education» more  TIT 2010»
13 years 4 months ago
A lower bound on the optimum distance profiles of the second-order Reed-Muller codes
In this paper, we give a lower bound for the optimum distance profiles of the second-order Reed
Yanling Chen, A. J. Han Vinck
ICC
2009
IEEE
142views Communications» more  ICC 2009»
14 years 4 months ago
A Generalized Two-Way Relay Channel with Private Information for the Relay
—In the conventional two-way relay channel, two sources exchange information with help from a relay. We introduce a generalized two-way relay channel where each source additional...
Chin Keong Ho, Kiran T. Gowda, Sumei Sun
CIBCB
2007
IEEE
14 years 1 months ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre