Sciweavers

450 search results - page 32 / 90
» codes 1999
Sort
View
FOCS
1999
IEEE
14 years 2 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
ISCAS
1999
IEEE
124views Hardware» more  ISCAS 1999»
14 years 2 months ago
On the robustness of vector set partitioning image coders to bit errors
A vector enhancement of Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image co...
D. Mukherjee, S. K. Mitra
PPDP
1999
Springer
14 years 2 months ago
A Virtual Machine for a Process Calculus
Abstract. Despite extensive theoretical work on process-calculi, virtual machine specifications and implementations of actual computational models are still scarce. This paper pre...
Luís M. B. Lopes, Fernando M. A. Silva, Vas...
INFOCOM
1999
IEEE
14 years 2 months ago
Cell Identification Codes for Tracking Mobile Users
The minimization of the wireless cost of tracking mobile users is a crucial issue in wireless networks. Some of the previous strategies addressing this issue leave an open gap, by ...
Zohar Naor, Hanoch Levy
ECMAST
1998
Springer
118views Multimedia» more  ECMAST 1998»
14 years 2 months ago
Error-Robustness of Polar Contour-Coding
For communication using digital video, compression is mandatory because of the high bit-rate requiring a large bandwidth or storage capacity. Recent developments as well as upcomi...
Frank H. P. Spaan, Reginald L. Lagendijk, Jan Biem...