Results 31 to 40 of about 2,704 (173)
Binary Wyner-Ziv and CEO Problem Coding Under the Hamming Distortion Criterion [PDF]
In this paper, we present a practical encoding and decoding scheme for the binary Wyner-Ziv problem based on graph-based codes. Our proposed scheme uses low-density generator-matrix (LDGM) codes in lossy source coding part and low-density parity-check ...
Mahdi Nangir
doaj +1 more source
Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios [PDF]
This paper treats point-to-point, multiple access and random access lossless source coding in the finite-blocklength regime. A random coding technique is developed, and its power in analyzing the third-order coding performance is demonstrated in all ...
Chen, Shuqing +2 more
core +1 more source
Dynamic Quality Control for Transform Domain Wyner-Ziv Video Coding
Wyner-Ziv is an emerging video coding paradigm based on the Slepian-Wolf and Wyner-Ziv theorems where video coding may be performed by exploiting the temporal correlation at the decoder and not anymore at the encoder as in conventional video coding ...
Pereira Fernando +2 more
doaj +2 more sources
On Linear Coding over Finite Rings and Applications to Computing
This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans.
Sheng Huang, Mikael Skoglund
doaj +1 more source
Networked Slepian-Wolf: theory, algorithms, and scaling laws [PDF]
Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path ...
Beferull-Lozano, Baltasar +2 more
core +1 more source
The notion of source polarization is introduced and investigated. This complements the earlier work on channel polarization. An application to Slepian-Wolf coding is also considered. The paper is restricted to the case of binary alphabets.
Arikan, Erdal
core +3 more sources
Distributed Source Coding and Its Applications in Relaying-Based Transmission
Distributed source coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. DSC has numerous promising applications ranging from reduced-complexity handheld video communications to ...
Abdulah Jeza Aljohani +2 more
doaj +1 more source
On Zero-Error Source Coding with Feedback [PDF]
We consider the problem of zero error source coding with limited feedback when side information is present at the receiver. First, we derive an achievable rate region for arbitrary joint distributions on the source and the side information.
Bakshi, Mayank, Effros, MIchelle
core +1 more source
On practical design for joint distributed source and network coding [PDF]
This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint
Kung, S. +3 more
core +1 more source
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate-region. For finite alphabets we show that typicality decoding is equivalent to solving an integer program.
Dey, Bikash Kumar +2 more
openaire +2 more sources

