Name
Title | ||
|---|---|---|
Layered LDPC convolutional codes for compression of correlated sources under adversarial attacks |
Abstract | ||
|---|---|---|
We consider the problem of code design for compression of correlated sources under adversarial attacks. A scenario with three correlated sources is considered in which at most one source is compromised by an adversary. The theoretical minimum achievable sum-rate for this scenario was derived by Kosut and Tong. We design layered LDPC convolutional codes for this problem, assuming that one of the sources is available at the common decoder as side information. We demonstrate that layered LDPC convolutional codes constitute a sequence of nested codes where each sub-code is capacity-achieving for the binary symmetric channels used to model the correlation between sources, and therefore, can ideally achieve the theoretical minimum sum-rate. Simulated performance results for moderate block length show a small gap to the theoretical limit, and as the block length increases the gap vanishes. |
Year | Venue | Keywords |
|---|---|---|
2012 | Information Theory and its Applications | convolutional codes,decoding,parity check codes,adversarial attacks,binary symmetric channels,capacity-achieving,common decoder,correlated sources,layered LDPC convolutional codes,minimum achievable sum-rate,moderate block length,side information,subcode |
Field | DocType | ISBN |
Forward error correction,Concatenated error correction code,Convolutional code,Computer science,Low-density parity-check code,Block code,Serial concatenated convolutional codes,Turbo code,Theoretical computer science,Linear code | Conference | 978-1-4673-2521-9 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farshad Naghibi | 1 | 0 | 0.34 |
| Ragnar Thobaben | 2 | 295 | 30.12 |
| Somayeh Salimi | 3 | 7 | 0.83 |
| Mikael Skoglund | 4 | 1397 | 175.71 |