Fountain code design for data multicast with side information [PDF]
, 2009 —Fountain codes are a robust solution for data multicasting to a large number of receivers which experience variable channel conditions and different packet loss rates.
Mohamed Ismail +8 more
core +1 more source
Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding [PDF]
, 2015 International audienceIn this paper, we investigate the problem of designing good non-binary LDPC codes for Slepian-Wolf coding. The design method is based on Density Evolution which gives the asymptotic error probability of the decoder for given code ...
Savin, Valentin +2 more
core +1 more source
Iterative techniques for cooperative communications allowing intra-link errors- from the Slepian Wolf compression viewpoint (invited talk) [PDF]
, 2012 This paper aims to apply the Slepian Wolf theorem to a one-way relay system where intra-link errors are allowed. This indicates that the relay node does not aim to perfectly correct errors occurring in the intra-link.
Matsumoto, Tad, Burr, Alister
core
On Achievable Rate Regions for Source Coding Over Networks [PDF]
, 2009 In the field of source coding over networks, a central goal is to understand the best possible performance for compressing and transmitting dependent data distributed over a network.
Gu, WeiHsin
core +1 more source
Asymmetric and nonasymmetric Slepian-Wolf coding with polar codes
, 2012 Date of Conference: 18-20 April 2012Conference name: 20th Signal Processing and Communications Applications Conference (SIU), 2012Bu bildiride, düzgün marjinal dağılıma sahip kaynaklar için Slepian–Wolf (SW) hız egrisindeki herhangi bir noktaya ...
Saygun Onay, Önay, Saygun
core +1 more source
Variable-Rate Universal Slepian-Wolf Coding with Feedback
, 2006 Conference PaperTraditional 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.
Sarvotham, Shriram +2 more
core
Totally asynchronous slepian-wolf data compression
, 1988 It is proved that the Slepian-Wolf data compression theorem (1973) still holds when both encoders are operating totally asynchronously.
Willems, Frans M.J.
core +1 more source
Approaching the Slepian-Wolf Limit with LDPC Coset Codes
, 2008 We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem.
Ashish Jagmohan, Jun Chen, Dake He
core
Multi-terminal source code design based on slepian-Wolf coded quantization
, 2004 Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper presents two practical MT coding schemes under the same general framework of Slepian-Wolf coded quantization (SWCQ) for both ...
Zhao, Wei +3 more
core +3 more sources
On some new approaches to practical Slepian-Wolf compression inspired by channel coding
, 2004 We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the graphical structure of all the encoders and operates in a ‘turbo-like ...
Todd P Coleman +5 more
core