[1] R. Thobaben and J. Kliewer, “Low-Complexity Iterative Joint Source-Channel Decoding for Variable-Length Encoded Markov Sources,” IEEE Trans. Commun., vol. 53, no. 12, pp. 2054–2064, Dec. 2005.
[2] J. Kliewer and R. Thobaben, “Iterative Joint Source-Channel Decoding of Variable-Length Codes Using Residual Source Redundancy,” IEEE Trans. Wireless Commun., vol. 4, no. 3, pp. 919–929, 2005.
[3] T. Fingscheidt and P. Vary, “Softbit Speech Decoding: A New Approach to Error Concealment,” IEEE Trans. Speech Audio Processing, vol. 9, no. 3, pp. 240-251, 2001.
[4] J. Hagenauer, “Source-Controlled Channel Decoding,” IEEE Trans. Commun., vol. 43, pp. 2449-2457, Sep. 1995.
[5] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error Correcting Coding: Turbo Codes,” in Proc. IEEE International Conference on Communications (ICC), pp. 1064-1070, 1993.
[6] C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding And Decoding: Turbo-Codes,” IEEE Trans. on Commun., vol. 44, no. 10, pp. 1261-1271, 1996.
[7] R. Bauer and J. Hagenauer, “Symbol-by-symbol MAP decoding of variable length codes,” in Proc. 3rd ITG Conf. Source Channel Coding, Munich, Germany, Jan. 2000, pp. 111–116.
[8] R. Bauer and J. Hagenauer, “Iterative source/channel-decoding using reversible variable length codes,” in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2000, pp. 93–102.
[9] J. Kliewer and R. Thobaben, “Combining FEC and optimal soft-input source decoding for the reliable transmission of correlated variable- length encoded signals,” in Proc. IEEE Data Compression Conf., Snowbird, UT, Apr. 2002, pp. 83–91.
[10] R. Thobaben and J. Kliewer, “Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis,” IEEE Commun. Lett., vol. 7, no. 7, pp. 320–322, Jul. 2003.
[11] L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 287–294, Mar. 1974.
[12] R. Bauer and J. Hagenauer, “On variable length codes for iterative source/channel-decoding,”in Proc. IEEE Data Compression Conf., 2001,pp. 273-282.
[13] M. Adrat and P. Vary, “Iterative source-channel decoding: improved system design using EXIT charts,” EURASIP J. Appl. Signal Processin, pp. 928–941, May 2005.
[14] K. Zeger and A. Gersho, “Pseudo-gray coding,” IEEE Trans. Commun., vol. 38, no. 12, pp. 2147–2158, 1990.
[15] V. B. Balakirsky, “Joint source-channel coding with variable length codes,” in Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, Jum. 1997, p.419
[16] C. W. Tsai and J. L. Wu, “On constructing the Huffman-code based reversible variable length codes,” IEEE Trans. Commun., vol. 49, pp. 1506–1509, Sept. 2001.
[17] K. Lakovic´ and J. Villasenor, “On design of error-correcting reversible variable length codes,” IEEE Commun. Lett., vol. 6, no. 8, pp. 337–339, Aug. 2002.
[18] 潘彥璋,「基於索引層級的疊代訊源通解碼機制」,國立交通大學碩士論文,民國九十七年。[19] 陳亞民,「渦輪原則在合併訊源通道編碼之研究」,國立交通大學碩士論文,民國九十八年。