A. Hedayat and A. Nosratinia, Performance Analysis and Design Criteria for Finite-Alphabet Source-Channel Codes, IEEE Transactions on Communications, vol.52, issue.11, pp.1872-1879, 2004.
DOI : 10.1109/TCOMM.2004.836562

Y. Zhong, F. Alajaji, and L. L. Campbell, On the joint source-channel coding error exponent for discrete memoryless systems, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1450-1468, 2006.
DOI : 10.1109/TIT.2006.871608

T. M. Cover and J. M. Thomas, Elements of Information Theory, 1991.

A. S. Fraenkel and S. T. Klein, Bidirectional Huffman Coding, The Computer Journal, vol.33, issue.4, pp.296-307, 1990.
DOI : 10.1093/comjnl/33.4.296

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1125

Y. Takishima, M. Wada, and M. Murakimi, Reversible variable length codes, IEEE Transactions on Communications, vol.43, issue.2/3/4, pp.158-162, 1995.
DOI : 10.1109/26.380026

C. Tsai and J. Wu, On constructing the Huffman-code-based reversible variable-length codes, IEEE Transactions on Communications, vol.49, issue.9, pp.1506-1509, 2001.
DOI : 10.1109/26.950335

K. Lakovic and J. Villasenor, An algorithm for construction of efficient fix-free codes, IEEE Communications Letters, vol.7, issue.8, pp.391-393, 2003.
DOI : 10.1109/LCOMM.2003.815660

H. Tseng and C. Chang, Construction of Symmetrical Reversible Variable Length Codes Using Backtracking, The Computer Journal, vol.46, issue.1, pp.100-105, 2003.
DOI : 10.1093/comjnl/46.1.100

J. Wang, L. Yang, and L. Hanzo, Iterative Construction of Reversible Variable-Length Codes and Variable-Length Error-Correcting Codes, IEEE Communications Letters, vol.8, issue.11, pp.671-673, 2004.
DOI : 10.1109/LCOMM.2004.837645

C. Lin, J. Wu, and Y. Chuang, Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes, IEEE Transactions on Communications, vol.55, issue.12, pp.81-89, 2008.
DOI : 10.1109/TCOMM.2007.910584

Y. Huang, T. Wu, and Y. Han, An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length, IEEE Transactions on Communications, vol.58, issue.11, pp.3175-3185, 2010.
DOI : 10.1109/TCOMM.2010.091710.0901872

K. Lakovic and J. Villasenor, On design of error-correcting reversible variable length codes, IEEE Communications Letters, vol.6, issue.8, pp.337-339, 2002.
DOI : 10.1109/LCOMM.2002.802041

R. Thobaben and J. Kliewer, An efficient variable-length code construction for iterative source-channel decoding, IEEE Transactions on Communications, vol.57, issue.7, pp.2005-2013, 2009.
DOI : 10.1109/TCOMM.2009.07.070570

V. Buttigieg, On variable-length error-correcting codes, Proceedings of 1994 IEEE International Symposium on Information Theory, 1995.
DOI : 10.1109/ISIT.1994.395122

V. Buttigieg and P. Farrell, On variable-length error-correcting codes, Proceedings of 1994 IEEE International Symposium on Information Theory, pp.211-215, 2000.
DOI : 10.1109/ISIT.1994.395122

C. Lamy and J. Paccaut, Optimised constructions for variable-length error correcting codes, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), pp.183-186, 2003.
DOI : 10.1109/ITW.2003.1216725

J. Wang, L. Yang, and L. Hanzo, Iterative Construction of Reversible Variable-Length Codes and Variable-Length Error-Correcting Codes, IEEE Communications Letters, vol.8, issue.11, pp.671-673, 2004.
DOI : 10.1109/LCOMM.2004.837645

R. Maunder and L. Hanzo, Genetic Algorithm Aided Design of Component Codes for Irregular Variable Length Coding, IEEE Transactions on Communications, vol.57, issue.5, pp.1290-1297, 2009.
DOI : 10.1109/TCOMM.2009.05.070234

S. Savari, On optimal reversible-variable-length codes, 2009 Information Theory and Applications Workshop, pp.311-317, 2009.
DOI : 10.1109/ITA.2009.5044962

N. Abedini, S. P. Khatri, and S. A. Savari, A SAT-Based Scheme to Determine Optimal Fix-Free Codes, 2010 Data Compression Conference, pp.169-178, 2010.
DOI : 10.1109/DCC.2010.22

V. Buttigieg and P. Farrell, On variable-length error-correcting codes, Proceedings of 1994 IEEE International Symposium on Information Theory, p.507, 1994.
DOI : 10.1109/ISIT.1994.395122

C. Weidmann and M. Kieffer, Evaluation of the distance spectrum of variable-length finite-state codes, IEEE Transactions on Communications, vol.58, issue.3, pp.724-728, 2010.
DOI : 10.1109/TCOMM.2010.03.090051

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

A. Diallo, C. Weidmann, and M. Kieffer, Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes, IEEE Transactions on Communications, vol.59, issue.4, pp.1043-1052, 2011.
DOI : 10.1109/TCOMM.2011.020411.090780

URL : https://hal.archives-ouvertes.fr/hal-00549258

M. Gondran and M. Minoux, Graphs and algorithms, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

R. G. Gallager, Information theory and reliable communication, 1968.
DOI : 10.1007/978-3-7091-2945-6

R. G. Johannesson, K. S. Zigangirov, A. W. Aho, J. E. Hopcroft, and J. D. Ullman, Fundamentals of convolutional coding The design and Analysis of Computer Algorithms, 1974.

S. R. Buss, Alogtime algorithms for tree isomorphism, comparison, and canonization, Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, pp.18-33, 1997.
DOI : 10.1007/3-540-63385-5_30