Results 31 to 40 of about 160 (137)
Wireless key generation system for internet of vehicles based on deep learning
In recent years, the widespread application of internet of vehicles technology has garnered attention due to its complex nature and point-to-point communication characteristics.Critical and sensitive vehicle information is transmitted between different ...
Han WANG, Liquan CHEN, Zhongmin WANG, Tianyu LU
doaj +3 more sources
An Efficient SF-ISF Approach for the Slepian-Wolf Source Coding Problem
A simple but powerful scheme exploiting the binning concept for asymmetric lossless distributed source coding is proposed. The novelty in the proposed scheme is the introduction of a syndrome former (SF) in the source encoder and an inverse syndrome ...
Tu Zhenyu +2 more
doaj +1 more source
Slepian-Wolf Code Design via Source-Channel Correspondence [PDF]
to appear at ISIT ...
Chen, Jun, He, Da-ke, Jagmohan, Ashish
openaire +2 more sources
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
Content caching has emerged as an effective approach to combat the increasing strains on our current network infrastructure. This method is further improved when combining caching with source coding. However, additional complexity is incurred by creating
Benjamin Rosen, Ling Cheng
doaj +1 more source
A Mutual Algorithm for Optimizing Distributed Source Coding in Wireless Sensor Networks
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
Variable-Rate Universal Slepian-Wolf Coding with Feedback [PDF]
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
Kolmogorov complexity version of Slepian-Wolf coding [PDF]
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
Code Design for the Noisy Slepian-Wolf Problem [PDF]
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
Universal Slepian-Wolf Coding for Individual Sequences
26 pages; submitted for ...
openaire +2 more sources

