Toward constructive slepain-wolf coding schemes

Distributed Source Coding

Volumn , Issue , 2009, Pages 131-156

  Guillemot, Christine ^a   Roumy, Aline ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84882330466     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-374485-2.00011-1     Document Type: Chapter

References (42)

1. Aaron A., Girod B. Compression with side information using turbo codes. Proceedings of the IEEE International Data Compression Conference (DCC) Apr. 2002, 0(0):252-261.
2. Al Jabri A.K., Al-Issa S. Zero-error codes for correlated information sources. Proceedings of the IMA International Conference on Cryptography and Coding Dec. 1997, 17-22.
3. Artigas X., Malinowski S., Guillemot C., Torres L. Overlapped quasi-arithmetic codes for distributed video coding. Proceedings of the IEEE International Conference on Image Processing (ICIP) Sept. 2007, II.9-II.12.
4. Bahl L.R., Cocke J., Jelinek F., Raviv J. Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory Mar. 1974, 284-287. IT-20.
5. Bajcsy J., Mitran P. Coding for the Slepian-Wolf problem with turbo codes. Proceedings of the IEEE International Global Communications Conference (Globecom) Dec. 2001, 1400-1404.
6. Cabarcas F., Garcia-Frias J. Approaching the Slepian-Wolf boundary using practical channel codes. Proceedings IEEE International Symposium on Information Theory June 2004, 330.
7. Chen J., Khisti A., Malioutov D.M., Yedidia J.S. Distributed source coding using seriallyconcatenated-accumulate codes. Proceedings of the IEEE International Information Theory Workshop Oct. 2004, 209-214.
8. Garcia-Frias J., Cabarcas F. Approaching the Slepian-Wolf boundary using practical channel codes. Signal Processing 2006, 86(11):3096-3101.
9. Garcia-Frias J., Zhao Y. Compression of correlated binary sources using turbo codes. IEEE Communications Letters 2001, 5(10):417-419.
10. Gehrig N., Dragotti P.L. Symmetric and asymmetric Slepian-Wolf codes with systematic and non-systematic linear codes. IEEE Communications Letters Jan. 2005, 9(1):61-63.
11. Grangetto M., Magli E., Olmo G. Distributed arithmetic coding. IEEE Communications Letters Nov. 2007, 11(11):883-885.
12. Guionnet T., Guillemot C. Soft and joint source-channel decoding of quasi-arithmetic codes. EURASIP Journal on Applied Signal Processing Mar. 2004, 2004(3):394-411.
13. Howard P.G., Vitter J.S. Image and Text Compression. 1992, 85-112. Kluwer Academic Publishers.
14. Jiang J., He D., Jagmohan A. Rateless Slepian-Wolf coding based on rate adaptive low-density parity-check codes. Proceedings of the IEEE International Symposium on Information Theory June 2007, 1316-1320.
15. Li J., Alqamzi H. An optimal distributed and adaptive source coding strategy using ratecompatible punctured convolutional codes. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) Mar. 2005, 3(iii/685-iii/688):18-23.
16. Liveris A.D., Xiong Z., Georghiades C.N. Compression of binary sources with side information at the decoder using LDPC codes. IEEE Communications Letters Oct. 2002, 6(10):440-442.
17. Malinowski S., Artigas X., Guillemot C., Torres L. Distributed source coding using punctured quasi-arithmetic codes for memory and memoryless sources. IEEE Internationa Workshop on Signal Processing Systems Oct. 2008, Submitted to.
18. R. Pasco. Source coding algorithms for fast data compression. Ph.D thesis, Dept. of Electrical Engineering, Stanford Univ., 1976 Stanford, CA, 1976.
19. Pradhan S.S., Ramchandran K. Distributed source coding:Symmetric rates and applications to sensor networks. Proccedings of the IEEE International Data Compression Conference (DCC) Mar. 2000, 363-372.
20. Pradhan S.S., Ramchandran K. Distributed source coding using syndromes (DISCUS): Design and construction. Proceedings of the IEEE International Data Compression Conference (DCC) Mar. 1999, 158-167.
21. Rimoldi B., Urbanke R. Asynchronous Slepian-Wolf coding via source-splitting. Proceedings of the IEEE International Symposium on Information Theory July 1997, 271.
22. Rissanen J.J. Generalized Kraft inequality and arithmetic coding. IBM J. Res. Develop. May 1976, 20:198-203.
23. Rissanen J.J. Arithmetic codings as number representations. Acta Polytech. Scand. Math. Dec. 1979, 31:44-51.
24. Roumy A., Lajnef K., Guillemot C. Rate-adaptive turbo-syndrome scheme for Slepian-Wolf coding. Proceedings of the IEEE Asilomar Conference on Signals, Systems, and Computers Nov. 2007.
25. Sartipi M., Fekri F. Distributed source coding in wireless sensor networks using LDPC coding: The entire Slepian-Wolf rate region. Proceedings of the IEEE Wireless Communications and Networking Conference Mar. 2005, 4(0):1939-1944.
26. Sartipi M., Fekri F. Distributed source coding using short to moderate length rate-compatible LDPC codes: The entire Slepian-Wolf rate region. IEEE Transactions on Communications Mar. 2008, 56(3):400-411.
27. Schonberg D., Ramchandran K., Pradhan S.S. Distributed code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources. Proceedings of the IEEE International Data Compression Conference (DCC) Mar. 2004, 292-301.
28. Sidorenko V., Zyablov V. Decoding of convolutional codes using a syndrome trellis. IEEE Transactions on Information Theory Sept. 1994, 40(5):1663-1666.
29. Slepian D., Wolf J.K. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory July 1973, 471-480. IT-19.
30. Stankovic V., Liveris A.D., Xiong Z., Georghiades C.N. Design of Slepian-Wolf codes by channel code partitioning. Proceedings of the IEEE International Data Compression Conference (DCC) 2004, 302-311.
31. Stankovic V., Liveris A.D., Xiong Z., Georghiades C.N. On code design for the Slepian-Wolf problem and lossless multiterminal networks. IEEE Transactions on Information Theory Apr. 2006, 52(4):1495-1507.
32. Tan P., Li J. Enhancing the robustness of distributed compression using ideas from channel coding. Proceedings of the IEEE International Global Telecommunications Conference (GLOBECOM) Dec. 2005, 4(5).
33. Tan P., Li J. A practical and optimal symmetric Slepian-Wolf compression strategy using syndrome formers and inverse syndrome formers. Proceeding of 43rd Annual Allerton Conference on Communication, Control and Computing Sept. 2005.
34. Toto-Zarasoa V., Roumy A., Guillemot C. Rate-adaptive codes for the entire Slepian-Wolf region and arbitrarily correlated sources. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) Apr. 2008.
35. Tu Z., Li J., Blum R.S. An efficient SF-ISF approach for the Slepian-Wolf source coding problem. EURASIP Journal on Applied Signal Processing May 2005, 2005(6):961-971.
36. Varodayan D., Aaron A., Girod B. Rate-adaptive codes for distributed source coding. EURASIP Signal Processing Nov. 2006, 86(11):3123-3130.
37. Witten I.H., Neal R.M., Cleary J.G. Arithmetic coding for data compression. Communications of the ACM June 1987, 30(6):520-540.
38. Wolf J.K. Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Transactions on Information Theory Jan. 1978, 24(1):76-80.
39. Wyner A. Recent results in the Shannon theory. IEEE Transactions on Information Theory Jan. 1974, 20(1):2-10.
40. Zamir R., Shamai S., Erez U. Nested linear/lattice codes for structured multiterminal binning. IEEE Transactions on Information Theory June 2002, 48(6):1250-1276.
41. Zhao Q., Effros M. Optimal code design for lossless and near lossless source coding in multiple access network. Proceedings of the IEEE International Data Compression Conference (DCC) Mar. 2001, 263-272.
42. Zhao Y., Garcia-Frias J. Data compression of correlated non-binary sources using punctured turbo codes. Proceedings of the IEEE International Data Compression Conference (DCC) Apr. 2002, 242-251.