45 search results - page 3 / 9 » Universal Algorithms for Channel Decoding of Uncompressed So... |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
TIT
2008
13 years 7 months ago
2008
A source XXX goes through an erasure channel whose output is ZZZ. The goal is to compress losslessly XXX when the compressor knows XXX and ZZZ and the decompressor knows ZZZ. We pr...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...