Universal Slepian-Wolf coding for individual sequences [PDF]
We establish a coding theorem and a matching converse theorem for separate encodings and joint decoding of individual sequences using finite-state machines.
Merhav, Neri
core +1 more source
Low Computational Coding-Efficient Distributed Video Coding: Adding a Decision Mode to Limit Channel Coding Load. [PDF]
Entropy (Basel), 2023 Khursheed S +4 more
europepmc +1 more source
Function Computation under Privacy, Secrecy, Distortion, and Communication Constraints. [PDF]
Entropy (Basel), 2022 Günlü O.
europepmc +1 more source
Side Information Generation Scheme Based on Coefficient Matrix Improvement Model in Transform Domain Distributed Video Coding. [PDF]
Entropy (Basel), 2020 Wang W, Chen J.
europepmc +1 more source
Attaining Fairness in Communication for Omniscience. [PDF]
Entropy (Basel), 2022 Ding N +3 more
europepmc +1 more source
Expand-and-Randomize: An Algebraic Approach to Secure Computation. [PDF]
Entropy (Basel), 2021 Zhao Y, Sun H.
europepmc +1 more source
An Optimization-Linked Intelligent Security Algorithm for Smart Healthcare Organizations. [PDF]
Healthcare (Basel), 2023 Irshad RR +6 more
europepmc +1 more source
Redundancy rates of Slepian-Wolf coding
, 2004 The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in design of distributed source codes, along with the need for distributed compression in sensor networks, has made it crucial ...
Mohammad Ali Khojastepour +2 more
core
Distributed video coding in wireless multimedia sensor network for multimedia broadcasting [PDF]
, 2008 Recently the development of Distributed Video Coding (DVC) has provided the promising theory support to realize the infrastructure of Wireless Multimedia Sensor Network (WMSN), which composed of autonomous hardware for capturing and transmission of ...
Zhuo, X, Loo, KK, Cosmas, J, Yip, PY
core
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
, 2004 The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources are i.i.d but nonuniformly distributed.
Jing (Tiffany) Li +2 more
core