J. Kieffer and E. Yang, Grammar-based codes: a new class of universal lossless source codes, IEEE Transactions on Information Theory, vol.46, issue.3, pp.737-754, 2000.
DOI : 10.1109/18.841160

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

M. J. Gormish, Source coding with channel, distortion and complexity constraints, 1994.

T. Eriksson, Trellis source coding methods for low rates and short blocks, 2005.

R. M. Gray and D. L. Neuhoff, Quantization, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2325-2384, 1998.
DOI : 10.1109/18.720541

P. G. Howard and J. S. Vitter, Practical Implementations of Arithmetic Coding, Image and Text compression, pp.85-112, 1992.
DOI : 10.1007/978-1-4615-3596-6_4

E. Yang and D. He, Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models, IEEE Transactions on Information Theory, vol.49, issue.11, pp.2874-2894, 2003.
DOI : 10.1109/TIT.2003.818411

D. Huffman, A method for the construction of minimum redundancy codes, Proc. of the Inst, pp.1098-1101, 1952.

T. C. Hu and A. C. Tucker, Optimal Computer Search Trees and Variable-Length Alphabetical Codes, SIAM Journal on Applied Mathematics, vol.21, issue.4, pp.514-532, 1971.
DOI : 10.1137/0121057

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

K. P. Subbalakshmi and J. Vaisey, On the joint source-channel decoding of variable-length encoded sources: the BSC case, IEEE Transactions on Communications, vol.49, issue.12, pp.2052-2055, 2001.
DOI : 10.1109/26.974247

S. Lonardi and W. Szpankowski, Joint source-channel LZ'77 coding, Data Compression Conference, 2003. Proceedings. DCC 2003, pp.273-282, 2003.
DOI : 10.1109/DCC.2003.1194018

G. Zhu and F. Alajaji, Turbo codes for nonuniform memoryless sources over noisy channels, IEEE Commun. Lett, vol.6, pp.1253-1262, 2002.

G. Zhu, F. Alajaji, J. Bajcsy, and P. Mitran, Transmission of Nonuniform Memoryless Sources via Nonsystematic Turbo Codes, IEEE Transactions on Communications, vol.52, issue.8, pp.1344-1354, 2004.
DOI : 10.1109/TCOMM.2004.833026

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

H. Jégou and C. Guillemot, Suffix-constrained codes for progressive and robust data compression: self-multiplexed codes, Proc. Europ. Sign. Proc. Conf, 2004.

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