V. B. Balakirsky, Joint source-channel coding with variable length codes, Proceedings of IEEE International Symposium on Information Theory, p.419, 1997.
DOI : 10.1109/ISIT.1997.613356

C. Weidmann, Reduced-complexity soft-ln-soft-out decoding of variable-length codes, IEEE International Symposium on Information Theory, 2003. Proceedings., 2003.
DOI : 10.1109/ISIT.2003.1228215

X. Jaspar and L. Vandendorpe, New iterative decoding of variable length codes with turbo-codes, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004.
DOI : 10.1109/ICC.2004.1313003

R. Bauer and J. Hagenauer, Symbol by symbol map decoding of variable length codes, Proc. 3rd ITG Conf. Source and Channel Coding, 2000.

T. Guionnet and C. Guillemot, Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes, EURASIP Journal on Advances in Signal Processing, vol.2004, issue.3, pp.394-411, 2004.
DOI : 10.1155/S1110865704308085

S. Ben-jamaa, C. Weidmann, and M. Kieffer, Asymptotic errorcorrecting performance of joint source-channel schemes based on arithmetic coding, Proc. MMSP, pp.262-266, 2006.

S. Malinowski, H. Jégou, and C. Guillemot, Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes, IEEE Transactions on Information Theory, vol.53, issue.1, pp.368-377, 2007.
DOI : 10.1109/TIT.2006.887512

URL : https://hal.archives-ouvertes.fr/inria-00119600

S. Malinowski, H. Jégou, and C. Guillemot, Error recovery properties of quasi-arithmetic codes and soft decoding with length constraint, 2006 IEEE International Symposium on Information Theory, 2006.
DOI : 10.1109/ISIT.2006.261985

URL : https://hal.archives-ouvertes.fr/inria-00504569

J. Kliewer and R. Thobaben, Combining FEC and optimal soft-input source decoding for the reliable transmission of correlated variablelength encoded signals, Proc. Data Compression Conf., DCC, pp.83-91, 2002.

L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

J. Rissanen, Generalized Kraft Inequality and Arithmetic Coding, IBM Journal of Research and Development, vol.20, issue.3, pp.198-203, 1976.
DOI : 10.1147/rd.203.0198

G. Langdon, An Introduction to Arithmetic Coding, IBM Journal of Research and Development, vol.28, issue.2, 1984.
DOI : 10.1147/rd.282.0135

D. Bi, M. Hoffman, and K. Sayood, State machine interpretation of arithmetic codes for joint source and channel coding, Proc. Data Compression Conf., DCC, pp.143-152, 2006.

A. Viterbi, Error bounds for convolution codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory, issue.13, pp.260-269, 1967.

G. Battail, Pondération des symboles décodés par l'algorithme de Viterbi, Ann. Telecommmun, vol.42, pp.31-38, 1987.

L. Lin and R. Cheng, Improvements in SOVA-based decoding for turbo codes, Proc. ICC'97, 1997.