33 search results - page 3 / 7 » A Coding Theorem for a Class of Stationary Channels with Fee... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estim...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The goal of combining beamforming and space-time coding is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time...
IPSN
2003
Springer
14 years 19 days ago
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 s...
TIT
2002
13 years 7 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...