Random Binning and Turbo Source Coding for Lossless Compression of Memoryless Sources
暂无分享,去创建一个
[1] Ying Zhao,et al. Compression of binary memoryless sources using punctured turbo codes , 2002, IEEE Communications Letters.
[2] Joachim Hagenauer,et al. LOSSLESS TURBO SOURCE CODING WITH DECREMENTAL REDUNDANCY , 2004 .
[3] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[4] S. Verdú,et al. Noiseless Data Compression with Low-Density Parity-Check Codes , 2003, Advances in Network Information Theory.
[5] N. Dütsch. Code Optimization for Lossless Turbo Source Coding , 2005 .
[6] 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).
[7] E Weiss,et al. COMPRESSION AND CODING , 1962 .
[8] Edwin Weiss,et al. Compression and coding (Corresp.) , 1962, IRE Trans. Inf. Theory.
[9] Aaron D. Wyner,et al. Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .
[10] Walaa Hamouda,et al. Design of lossless turbo source encoders , 2006, IEEE Signal Processing Letters.
[11] Walaa Hamouda,et al. Lossless Source Coding using Tree Structured Random Binning , 2006, 2006 IEEE International Symposium on Information Theory.
[12] Teofilo C. Ancheta. Syndrome-source-coding and its universal generalization , 1976, IEEE Trans. Inf. Theory.
[13] Shlomo Shamai,et al. Fountain codes for lossless data compression , 2003, Algebraic Coding Theory and Information Theory.
[14] Walaa Hamouda,et al. Code detection in turbo source coding , 2006, IEEE Communications Letters.