Results 71 to 80 of about 2,704 (173)
Variable-Rate Universal Slepian-Wolf Coding with Feedback [PDF]
Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005., 2006 Traditional Slepian-Wolf coding assumes known statistics and relies on asymptotically long sequences. However, in practice the statistics are unknown, and the input sequences are of finite length. In this finite regime, we must allow a non-zero probability of codeword error isin and also pay a penalty by adding redundant bits in the encoding process ...
S. Sarvotham, D. Baron, R.G. Baraniuk
openaire +1 more source
EURASIP Journal on Wireless Communications and Networking, 2005 We consider the case of two correlated sources, and . The correlation between them has memory, and it is modelled by a hidden Markov chain. The paper studies the problem of reliable communication of the information sent by the source over an additive ...
Ser Javier Del +2 more
doaj +2 more sources
A Mutual Algorithm for Optimizing Distributed Source Coding in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2012 Wireless Sensor Networks (WSNs) are composed of small wireless nodes equipped with sensors, a processor, and a radio communication unit, all normally powered by batteries.
Nashat Abughalieh +3 more
doaj +1 more source
Are Slepian-Wolf Rates Necessary for Distributed Parameter Estimation?
, 2015 We consider a distributed parameter estimation problem, in which multiple terminals send messages related to their local observations using limited rates to a fusion center who will obtain an estimate of a parameter related to observations of all ...
Gamal, Mostafa El, Lai, Lifeng
core +1 more source
Kolmogorov complexity version of Slepian-Wolf coding [PDF]
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017 Alice and Bob are given two correlated n-bit strings x_1 and, respectively, x_2, which they want to losslessly compress and send to Zack. They can either collaborate by sharing their strings, or work separately. We show that there is no disadvantage in the second scenario: Alice and Bob, without knowing the other party's string, can achieve almost ...
openaire +2 more sources
The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources
, 2013 This paper studies the three-user finite-field multi-way relay channel, where the users exchange messages via a relay. The messages are arbitrarily correlated, and the finite-field channel is linear and is subject to additive noise of arbitrary ...
Johnson, Sarah J. +3 more
core +1 more source
Code Design for the Noisy Slepian-Wolf Problem [PDF]
IEEE Transactions on Communications, 2013 We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symmetric channels. The capacity of each channel is characterized by a single parameter which is not known at the transmitter.
Yedla, Arvind +2 more
openaire +2 more sources
A Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with Hidden Markov Correlation
, 2005 We consider the problem of compression of two memoryless binary sources, the correlation between which is defined by a Hidden Markov Model (HMM). We propose a Decision Feedback (DF) based scheme which when used with low density parity check codes results
Bhattad, Kapil, Narayanan, Krishna R.
core +4 more sources
Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding
, 2014 We consider polar codes for memoryless sources with side information and show that the blocklength, construction, encoding and decoding complexities are bounded by a polynomial of the reciprocal of the gap between the compression rate and the conditional
Abbe, Emmanuel, Liu, Jingbo
core +1 more source
Universal Slepian-Wolf Coding for Individual Sequences
IEEE Transactions on Information Theory26 pages; submitted for ...
openaire +2 more sources