Sciweavers

56 search results - page 7 / 12
» A universal scheme for Wyner-Ziv coding of discrete sources
Sort
View
DCC
2009
IEEE
14 years 1 months ago
Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Li...
DCC
2005
IEEE
14 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 1 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
INFOCOM
2012
IEEE
11 years 9 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
TIT
2002
129views more  TIT 2002»
13 years 6 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang