Layered LDPC convolutional codes for compression of correlated sources under adversarial attacks

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.