Sciweavers

199 search results - page 29 / 40
» Linear time encodable and list decodable codes
Sort
View
CORR
2008
Springer
87views Education» more  CORR 2008»
14 years 9 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
STACS
2009
Springer
15 years 4 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
ADHOCNETS
2009
Springer
15 years 2 days ago
Efficient Distribution of Large Files in UMTS Supported by Network Coded M2M Data Transfer with Multiple Generations
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
Larissa Popova, Wolfgang H. Gerstacker, Wolfgang K...
DCC
1995
IEEE
15 years 1 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
ICIP
2010
IEEE
14 years 7 months ago
Deterministic structured network coding for WWAN video broadcast with cooperative peer-to-peer repair
Recent research has exploited the multi-homing property (one terminal with multiple network interfaces) of modern devices to improve communication performance in wireless networks...
Xin Liu, Gene Cheung, Chen-Nee Chuah