Layered LDPC Convolutional Codes for Compression of Correlated Sources under Adversarial Attacks
2012 (English)In: 2012 International Symposium on Information Theory and Its Applications, ISITA 2012, IEICE , 2012, 165-169 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEICE , 2012. 165-169 p.
Binary symmetric channel, Block lengths, Code designs, Correlated sources, LDPC convolutional codes, Nested codes, Side information, Simulated performance, Small gaps, Sum-rate, Theoretical limits, Theoretical minimum
IdentifiersURN: urn:nbn:se:kth:diva-99264ISI: 000320850700035ScopusID: 2-s2.0-84873538811ISBN: 978-1-4673-2521-9OAI: oai:DiVA.org:kth-99264DiVA: diva2:541728
2012 International Symposium on Information Theory and Its Applications, ISITA 2012; Honolulu, HI; United States; 28 October 2012 through 31 October 2012
FunderICT - The Next Generation
QC 201301142012-07-232012-07-232014-05-27Bibliographically approved