Structured random codes and sensor network coding theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …
usually established via a two-stage approach: The sources are compressed into bits, and …
The case for structured random codes in network communication theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is
usually established via a two-stage approach: The sources are compressed into bits, and …
usually established via a two-stage approach: The sources are compressed into bits, and …
Optimal distortion-power tradeoffs in sensor networks: Gauss-Markov random processes
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 …
source-channel coding problem. The overall goal of the sensor network is to take …
Source-channel communication in sensor networks
M Gastpar, M Vetterli - Information Processing in Sensor Networks, 2003 - Springer
Sensors acquire data, and communicate this to an interested party. The arising coding
problem is often split into two parts: First, the sensors compress their respective acquired …
problem is often split into two parts: First, the sensors compress their respective acquired …
Optimal distortion-power tradeoffs in Gaussian sensor networks
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 …
source-channel coding problem. The overall goal of the sensor network is to take …
Separation theorems and partial orderings for sensor network problems
MC Gastpar - Networked Sensing Information and Control, 2008 - Springer
In this chapter, we discuss information-theoretic techniques to understand sensor network
performance. From an information-theoretic perspective, sensor network problems are …
performance. From an information-theoretic perspective, sensor network problems are …
Correlated sources over wireless channels: Cooperative source-channel coding
AD Murugan, PK Gopala… - IEEE Journal on Selected …, 2004 - ieeexplore.ieee.org
We consider wireless sensor networks deployed to observe arbitrary random fields. The
requirement is to reconstruct an estimate of the random field at a certain collector node. This …
requirement is to reconstruct an estimate of the random field at a certain collector node. This …
An algebraic and probabilistic framework for network information theory
SS Pradhan, A Padakandla… - Foundations and Trends …, 2020 - nowpublishers.com
In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …
random structured codes, ie, codes possessing algebraic properties, for network information …
A unified random coding bound
In this paper, we prove a unified achievability bound that generalizes and improves random
coding bounds for any combination of source coding, channel coding, joint source-channel …
coding bounds for any combination of source coding, channel coding, joint source-channel …
On practical design for joint distributed source and network coding
Y Wu, V Stankovic, Z Xiong… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
This paper considers the problem of communicating correlated information from multiple
source nodes over a network of noiseless channels to multiple destination nodes, where …
source nodes over a network of noiseless channels to multiple destination nodes, where …