Results 91 to 100 of about 160 (137)
Some of the next articles are maybe not open access.
Slepian–Wolf coding with quantum side information
Quantum Information Processing, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Liu, Zhengjun Xi, Heng Fan
openaire +1 more source
Asynchronous Slepian-Wolf code design
2009 IEEE International Symposium on Information Theory, 2009We consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous Slepian ...
null Zhibin Sun +3 more
openaire +1 more source
The dispersion of Slepian-Wolf coding
2012 IEEE International Symposium on Information Theory Proceedings, 2012We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities.
Vincent Y. F. Tan, Oliver Kosut
openaire +1 more source
Secure collaboration using Slepian-Wolf codes
2008 15th IEEE International Conference on Image Processing, 2008The problem of secure collaboration between two agents, A and B, with limited mutual trust is considered. Specifically, we consider a formulation wherein agent A would like to share information with agent B but only if B has correlated information. Our solution is based on the principles of source coding with decoder-only side information. The key idea
Dake He, Ashish Jagmohan, Ligang Lu
openaire +1 more source
Joint Slepian-Wolf/Dirty-paper coding
2013 IEEE International Conference on Communications (ICC), 2013We consider a joint Slepian-Wolf/Dirty-paper coding (SW-DPC) setup where a binary source needs to be transmitted over an additive white-Gaussian channel in the presence of interference known only at the encoder, as well as correlated side-information available only at the decoder.
Momin Uppal +2 more
openaire +1 more source
Asynchronous Slepian-Wolf coding via source-splitting
Proceedings of IEEE International Symposium on Information Theory, 2002The Slepian-Wolf coding problem for two sources is considered. It is known that vertices of the Slepian-Wolf region can be achieved with a complexity which is significantly lower than that of a general point and do not require that encoders are synchronized.
B. Rimoldi, R. Urbanke
openaire +1 more source
A flexible rate slepian-wolf code construction
IEEE Transactions on Communications, 2009A flexible rate Slepian-Wolf (SW) code is constructed, which is vital for wireless sensor network applications. The proposed solution is based on an efficient and practical algorithm to compute the syndrome of the rate-compatible convolutional codes (RCPC).
Mahdi Zamani, Farshad Lahouti
openaire +1 more source
Distributed source coding without Slepian-Wolf compression
2009 Information Theory and Applications Workshop, 2009Slepian-Wolf (SW) coding, which is concerned with separate near-lossless compression of correlated sources (with joint decoding), forms the basis of distributed source coding (DSC) and can be used to exploit the correlation among quantized sources in lossy DSC problems such as Wyner-Ziv (WZ) coding and multiterminal (MT) source coding.
null Yang Yang, null Zixiang Xiong
openaire +1 more source

