Structured Random Codes and Sensor Network Coding Theorems
Published • Mar 1, 2008
NobleIDNI2P53W01R85S57
Authors:,
Bobak Nazer
Michael Gastpar
Abstract
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 these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!