Sciweavers

Share
DCC
2005
IEEE

On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources

11 years 11 days ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields. By using this tool, we analyze the performance of SW codes based on LDPC codes and random permutations, and show that under some conditions, all but diminishingly small proportion of LDPC encoders and permutations are good enough for the design of practical SW systems when the coding length is very large.
Shengtian Yang, Peiliang Qiu
Added 14 Oct 2010
Updated 14 Oct 2010
Type Conference
Year 2005
Where DCC
Authors Shengtian Yang, Peiliang Qiu
Comments (0)
books