A Secure Error-Resilient Lossless Source Coding Scheme Based on Punctured Turbo Codes

In this paper, we develop a new error-resistant secure lossless source coding scheme for discrete sources. Recent results indicate that the same turbo principle that provides sub-optimal strategy for channel coding, can be used to obtain efficient source coding schemes. We extend the source turbo-coding idea to include security for transmission of the compressed data and also to ensure the lossless recovery of information at the receiver. Compression and security are achieved by adapting the random puncturing strategy to the statistics of the source. Lossless compression is guaranteed by finely puncturing the encoded data of a parallel-concatenated turbo code while verifying the integrity of the source information at the source encoder. Simulation results show that the proposed scheme can obtain a compression rate close to the source entropy. For the same block length, this scheme yields better compression rates in comparison with the Lempel-Ziv universal source coding. The proposed scheme has a robust and error-resistant performance over noisy channels for E b / N 0 >5 dB.

[1]  Frederick Jelinek.  Tree encoding of memoryless time-discrete sources with a fidelity criterion , 1969, IEEE Trans. Inf. Theory.

[2]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[3]  E Weiss,et al.  COMPRESSION AND CODING , 1962 .

[4]  Shlomo Shamai,et al.  A new data compression algorithm for sources with memory based on error correcting codes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[5]  H. Yamamoto,et al.  A coding theorem for lossy data compression by LDPC codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[6]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[7]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[8]  Ian H. Witten,et al.  On the privacy afforded by adaptive text compression , 1988, Comput. Secur..

[9]  John G. Cleary,et al.  On the insecurity of arithmetic coding , 1995, Comput. Secur..

[10]  Teofilo C. Ancheta.  Syndrome-source-coding and its universal generalization , 1976, IEEE Trans. Inf. Theory.

[11]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[12]  Tatsuto Murayama,et al.  Statistical mechanics of data compression theorem , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  Ying Zhao,et al.  Compression of binary memoryless sources using punctured turbo codes , 2002, IEEE Communications Letters.

[14]  René Struik,et al.  The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack , 1987, CRYPTO.

[15]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[16]  Tadashi Wadayama.  A LOSSY COMPRESSION ALGORITHM FOR DISCRETE MEMORYLESS SOURCES BASED ON LDPC CODES , 2003 .

[17]  Ying Zhao,et al.  Compression of correlated binary sources using turbo codes , 2001, IEEE Communications Letters.

[18]  Jun Muramatsu,et al.  Low-density parity-check matrices for coding of correlated sources , 2003, IEEE Transactions on Information Theory.

[19]  Joachim Hagenauer,et al.  LOSSLESS TURBO SOURCE CODING WITH DECREMENTAL REDUNDANCY , 2004 .