Sciweavers

56 search results - page 8 / 12
» A universal scheme for Wyner-Ziv coding of discrete sources
Sort
View
DCC
2003
IEEE
14 years 6 months ago
Performance of universal codes over infinite alphabets
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
Alon Orlitsky, Narayana P. Santhanam
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 6 months ago
Lossless coding for distributed streaming sources
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...
Cheng Chang, Stark C. Draper, Anant Sahai
TCOM
2010
85views more  TCOM 2010»
13 years 1 months ago
Achieving the rate-distortion bound with low-density generator matrix codes
It is shown that binary low-density generator matrix codes can achieve the rate-distortion bound of discrete memoryless sources with general distortion measure via multilevel quant...
Zhibin Sun, Mingkai Shao, Jun Chen, Kon Max Wong, ...
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 6 months ago
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
Deniz Gündüz, Elza Erkip, Andrea J. Gold...
TIP
1998
122views more  TIP 1998»
13 years 6 months ago
An error resilient scheme for image transmission over noisy channels with memory
Abstract— This correspondence addresses the use of a joint sourcechannel coding strategy for enhancing the error resilience of images transmitted over a binary channel with addit...
Philippe Burlina, Fady Alajaji