Skip to main content

Advertisement

Joint Source, Channel Coding, and Secrecy

Article metrics

  • 1144 Accesses

  • 6 Citations

Abstract

We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes achieve satisfactory performance; they also eliminate the need for external compression and ciphering blocks with a significant potential computational advantage.

[12345678910111213141516]

References

  1. 1.

    Mohr A, Riskin E, Ladner R: Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction. IEEE Journal on Selected Areas in Communications 2000, 18(6):819-828. 10.1109/49.848236

  2. 2.

    Grangetto M, Cosman P, Olmo G: Joint source/channel coding and MAP decoding of arithmetic codes. IEEE Transactions on Communications 2005, 53(6):1007-1016. 10.1109/TCOMM.2005.849690

  3. 3.

    Garcia-Frias J, Zhao Y: Compression of binary memoryless sources using punctured turbo codes. IEEE Communications Letters 2002, 6(9):394-396. 10.1109/LCOMM.2002.803484

  4. 4.

    Grangetto M, Magli E, Olmo G: Multimedia selective encryption by means of randomized arithmetic coding. IEEE Transactions on Multimedia 2006, 8(5):905-917.

  5. 5.

    Wu C-P, Kuo C-CJ: Design of integrated multimedia compression and encryption systems. IEEE Transactions on Multimedia 2005, 7(5):828-839.

  6. 6.

    Johnson M, Ishwar P, Prabhakaran V, Schonberg D, Ramchandran K: On compressing encrypted data. IEEE Transactions on Signal Processing 2004, 52(10):2992-3006. 10.1109/TSP.2004.833860

  7. 7.

    McEliece RJ: A public-key cryptosystem based on algebraic coding theory. In DSN Progress Report 42-44. Jet Propulsion Laboratory, Pasadena, Calif, USA; 1978:114-116.

  8. 8.

    Payandeh A, Ahmadian M, Reza Aref M: Adaptive secure channel coding based on punctured turbo codes. IEE Proceedings: Communications 2006, 153(2):313-316. 10.1049/ip-com:20050086

  9. 9.

    Xu L: A general encryption scheme based on MDS code. Proceedings IEEE International Symposium on Information Theory (ISIT '03), June-July 2003, Yokohama, Japan 19.

  10. 10.

    Anderson JB, Mohan S: Source and Channel Coding. Kluwer Academic Publishers, Norwell, Mass, USA; 1991.

  11. 11.

    Moo PW, Wu X: Resynchronization properties of arithmetic coding. Proceedings of IEEE International Conference on Image Processing (ICIP '99), October 1999, Kobe, Japan 2: 545-549.

  12. 12.

    Cleary JG, Irvine SA, Rinsma-Melchert I: On the insecurity of arithmetic coding. Computers and Security 1995, 14(2):167-180. 10.1016/0167-4048(95)97050-K

  13. 13.

    Kim H, Wen J, Villasenor JD: Secure arithmetic coding. IEEE Transactions on Signal Processing 2007, 55(5):2263-2272.

  14. 14.

    Ryan WE: A turbo code tutorial. 1997.http://www.ece.arizona.edu/~ryan/http://www.ece.arizona.edu/~ryan/

  15. 15.

    Morelos-Zaragoza RH: The Art of Error Correcting Coding. 2nd edition. John Wiley & Sons, New York, NY, USA; 2006.

  16. 16.

    Rao TRN, Nam K-H: Private-key algebraic-code encryptions. IEEE Transactions on Information Theory 1989, 35(4):829-833. 10.1109/18.32159

Download references

Author information

Correspondence to Enrico Magli.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Keywords

  • Source Code
  • Binary Data
  • Data Security
  • Satisfactory Performance
  • Channel Code