57 search results - page 6 / 12 » A functional view of upper bounds on codes |
161
Voted
DM
2007
15 years 5 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...
132
click to vote
TIT
2002
15 years 5 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...
157
click to vote
TIT
2008
15 years 5 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...
150
click to vote
CORR
2006
Springer
15 years 5 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 ...
159
click to vote
CORR
2006
Springer
15 years 5 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 ...