57 search results - page 6 / 12 » A functional view of upper bounds on codes |
DM
2007
14 years 10 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
TIT
2002
14 years 9 months ago
2002
We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the tradeoff. Using a natural distortion measure based on en...
TIT
2008
14 years 10 months ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...