, Information theory and coding, 1963.
, An algorithm for computing the capacity of arbitrary DMCs, IEEE Trans. Inform. Theory, vol.18, pp.11-20, 1972.
, Joint source-channel coding with variable length codes
, 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
, A maximum likelihood decoding algorithm for variable-length error-correcting codes, Proc. 5th Bangor Symposium on Communications, pp.56-59, 1993.
, Near Shannon limit errorcorrecting coding and decoding : Turbo codes, Proc. Intl. Conf. Commun, pp.1064-1070, 1993.
, Iterative source-channel decoding based on a trellis representation for variable length codes, Proc. Intl. Conf. Inform. Theory, p.238, 2000.
, Iterative source-channel decoding using reversible variable length codes, Proc. Data Compression Conf, pp.93-102, 2000.
, Symbol by symbol MAP decoding of variable length codes, Proc. 3rd ITG Conf. Source and Channel Coding, 2000.
, Turbo FEC/VLC decoding and its application to text compression, Proc. Conf. Inform. Theory and Systems, pp.6-6, 2000.
, Is Huffman coding dead ? Computing, pp.279-296, 1993.
, Soft source decoding with applications, IEEE Trans. Circuits Syst. Video Technol, vol.11, issue.10, pp.1108-1120, 2001.
, Computation of channel capacity and rate distortion functions, IEEE Trans. Inform. Theory, vol.18, pp.460-473, 1972.
, Transform techniques for error control codes, IBM J.RES. DEVELOP, vol.23, issue.3, 1979.
, Book review : Error control coding, IEEE Trans. Inform. Theory, vol.51, issue.4, pp.1616-1617, 2005.
, Variable-length error-correcting codes, 1995.
, On the characterization of statistically synchronizable variable-length codes, IEEE Transactions on Information Theory, vol.34, issue.4, pp.817-825, 1988.
DOI : 10.1109/18.9779
, Multilayered protection of embedded video bitstreams over binary symmetric and packet erasure channels, Journal of Visual Communication and Image Representation, vol.16, issue.3, pp.359-378, 2005.
DOI : 10.1016/j.jvcir.2004.08.001
, On the construction of statistically synchronizable codes, IEEE Transactions on Information Theory, vol.38, issue.2, pp.407-414, 1992.
DOI : 10.1109/18.119696
, Elements of Information Theory, 1991.
, Joint source-channel coding of scalable video over noisy channels, Proc. Intl. Conf. Image Processing, pp.767-770, 1996.
, Joint source and noisy channel trellis encoding (Corresp.), IEEE Transactions on Information Theory, vol.27, issue.4, pp.516-519, 1981.
DOI : 10.1109/TIT.1981.1056366
, A note on two problems in connexion with graphs, Numer. Math, vol.1, pp.269-271, 1959.
, Joint source/channel coding for variable length codes, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), pp.139-148, 1998.
DOI : 10.1109/DCC.1998.672140
, Variable-to-variable length codes with small redundancy rates, Proc. of the 2002 IEEE International Symposium on Information Theory, 2004.
DOI : 10.1109/isit.2004.1365130
, On the complexity of joint source-channel decoding of Markov sequences over memoryless channels, Proc. Intl. Conf. Inform. Theory, 2005.
, Hidden Markov processes, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1518-1569, 2002.
DOI : 10.1109/TIT.2002.1003838
, Trellis Source Coding Methods for Low Rates and Short Blocks, 2005.
, A study of vector quantization for noisy channels, IEEE Trans. Inform. Theory, vol.36, issue.4, pp.799-809, 1990.
, On the performance and complexity of channel-optimized vector quantizers, IEEE Transactions on Information Theory, vol.37, issue.1, pp.155-160, 1991.
DOI : 10.1109/18.61130
, Codage conjoint source canal-Applications aux transmissions d'images par satellites, 2001.
, The Arimoto-Blahut algorithm for fin- ding channel capacity, technical note, 1994.
, Joint source-channel soft decoding of Huffman sources with turbo-codes, Proc. Data Compression Conf, pp.83-92, 2000.
, Joint source-channel turbo decoding of entropy-coded sources, IEEE Journal on Selected Areas in Communications, vol.19, issue.9, pp.1680-1696, 2001.
DOI : 10.1109/49.947033
, Soft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels, IEEE Transactions on Image Processing, vol.12, issue.12, pp.1599-1609, 2003.
DOI : 10.1109/TIP.2003.819307
, Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes, EURASIP Journal on Advances in Signal Processing, vol.2004, issue.3, pp.393-411, 2004.
DOI : 10.1155/S1110865704308085
, Using simulated annealing to design good codes, IEEE Transactions on Information Theory, vol.33, issue.1, pp.116-123, 1987.
DOI : 10.1109/TIT.1987.1057277
, Quantization, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2325-2384, 1998.
DOI : 10.1109/18.720541
, Run-length encodings, IEEE Trans. Inform. Theory, vol.12, issue.3, pp.399-401, 1966.
, Source Coding with Channel, Distortion and Complexity Constraints, 1994.
, Entropy and Information Theory, 1990.
, Contribution aux algorithmes de décodage dans les codes graphiques, 2002.
, Rate-compatible punctured convolutional codes and their applications, IEEE Trans. Commun, vol.36, issue.4, pp.389-400, 1988.
, 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
, A method for the construction of minimum redundancy codes, Proc. of the IRE, pp.1098-1101, 1952.
, Practical implementations of arithmetic coding. Image and Text compression, pp.85-112, 1992.
, Joint Source-Channel Decoding of Variable-Length Codes for Convolutional Codes and Turbo Codes, IEEE Transactions on Communications, vol.53, issue.1, pp.10-15, 2005.
DOI : 10.1109/TCOMM.2004.840664
URL : https://hal.archives-ouvertes.fr/hal-00772805
, Source code : C++ implementation of the for proposed algorithms
, Error-resilient binary multiplexed source codes, Proc. Intl. Conf. Acc. Speech Signal Processing, 2003.
, First-order multiplexed codes : performance bounds, design and decoding algorithms, IEEE Trans. Signal Processing, 2003.
, A new class of codes for transmission of heterogeneous data : Multiplexed codes, INRIA Research Report, vol.4922, 2003.
, Source multiplexed codes for error-prone channels, Proc. Intl. Conf. Commun, 2003.
, Error-resilient and progressive transmission and decoding of compressed images, Proc. WIAMIS'2004, 2004.
, First-order multiplexed source codes for error-resilient entropy coding, Proc. Intl. Conf. Inform. Theory, 2004.
, Suffix-constrained codes for progressive and robust data compression : self-multiplexed codes, Proc. EUSIP- CO, 2004.
, Codage entropique à base de règles de réécriture, GRETSI, 2005.
, Entropy coding with variable length rewriting systems, Proc. Intl. Conf. Inform. Theory, 2005.
, Progressive and error-resilient strategies for VLC encoded signals over noisy channels, EURASIP Journal of Applied Signal Processing, 2005.
, Robust multiplexed codes for compression of heterogeneous data, IEEE Trans. Inform. Theory, pp.1393-1407, 2005.
, Décodage conjoint source/canal par aggrégation d'états et décodage multi-treillis, Compression et représentation des signaux audiovisuels
, Trellis state aggregation for soft decoding of variable length codes, IEEE Workshop on Signal Processing Systems, 2005.
, 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
, Performance and Convergence Analysis of Joint Source-Channel Turbo Schemes with Variable Length Codes, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., pp.485-488, 2005.
DOI : 10.1109/ICASSP.2005.1415752
, Error containment in compressed data using sync markers, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), p.428, 2000.
DOI : 10.1109/ISIT.2000.866726
, Bounds of redundancy estimates for word-based encoding of sequences produced by a Bernouilli source, Problemy Peradachi Informacii, vol.8, pp.21-32, 1972.
, Data synchronisation with timing, Proc. Intl. Conf. Inform. Theory, p.427, 2000.
, Multiplication of multidigit numbers on automata. Soviet Physics Doklady, 1963.
, Parallel concatenated joint source-channel coding, Electronics Letters, vol.39, issue.23, pp.1664-1666, 2003.
, Iterative joint source-channel decoding of variable-length codes using residual source redundancy, IEEE Transactions on Wireless Communications, vol.4, issue.3, pp.919-929, 2005.
DOI : 10.1109/TWC.2005.847032
, 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
, Error Control Coding, 2004.
, Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics Doklady, vol.10, pp.707-710, 1966.
, A fast algorithm for optimal length-limited Huffman codes, Journal of the ACM, vol.37, issue.3, pp.464-473, 1990.
DOI : 10.1145/79147.79150
, Data partitioning and reversible variable length codes for robust video communications, Proc. Data Compression Conf, pp.460-469, 2000.
, Self-synchronizing variable-length codes for image transmission, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.477-480, 1992.
DOI : 10.1109/ICASSP.1992.226172
, Joint source-channel LZ'77 coding, Data Compression Conference, 2003. Proceedings. DCC 2003, pp.273-282, 2003.
DOI : 10.1109/DCC.2003.1194018
, Information Theory, Inference and Learning algorithms, 2003.
, Décodage souple des codes à longueur variable. Master's thesis, Ecole Nat, 2005.
, Exploiting the residual redundancy in motion estimation vectors to improve the quality of compressed video transmitted over noisy channels, Proc. Intl. Conf. Image Processing, 1998.
, Joint source-channel decoding of variable length encoded sources, Proc. Inform. Theory Workshop, pp.94-95, 1998.
, Robust transmission of variable-length encoded sources, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), pp.964-968, 1999.
DOI : 10.1109/WCNC.1999.796815
, Improving the performance of variablelength encoded systems through cooperation between source and channel decoders, Proc. Intl. Conf. Inform. Theory, p.264, 2000.
, Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes, IEEE Transactions on Information Theory, vol.53, issue.1, 2005.
DOI : 10.1109/TIT.2006.887512
URL : https://hal.archives-ouvertes.fr/inria-00119600
, Treillis à complexité réduite pour le décodage de codes à longueur variable, Actes de GRETSI, 2005.
, Corrections and additions to 'Error recovery for variable length codes' by J.C. Maxted and J.P. Robinson, IEEE Transactions on Information Theory, vol.33, issue.3, pp.454-456, 1987.
DOI : 10.1109/TIT.1987.1057297
, A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models, IEEE Transactions on Communications, vol.46, issue.2, pp.222-231, 1998.
DOI : 10.1109/26.659481
, Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard, IEEE Transactions on Circuits and Systems for Video Technology, vol.13, issue.7, 2003.
DOI : 10.1109/TCSVT.2003.815173
, Estimation of redundancy in compressed image and video data for joint source/channel decoding, Globecom, pp.2198-2202, 2003.
, Source Coding Algorithms for Fast Data Compression, 1976.
, Decoding entropy-coded symbols over noisy channels using discrete HMMs, Conf. In Information Sciences and Systems, 1998.
, Optimized source coding and coded modulation for digital transmission of still images on a noisy channel, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269), pp.142-146, 1998.
DOI : 10.1109/ICIP.1998.723334
, Joint source/channel coding using arithmetic codes, Proc. Data Compression Conf, 2000.
, Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes, The Computer Journal, vol.47, issue.3, pp.309-319, 2004.
DOI : 10.1093/comjnl/47.3.309
, Near optimum decoding of product codes : block turbo codes, IEEE Trans. Commun, vol.46, issue.8, pp.1003-1010, 1998.
, Generalized Kraft inequality and arithmetic coding, J. Research and Development, vol.20, issue.3, pp.198-203, 1976.
, The EREC: an error-resilient technique for coding variable-length blocks of data, IEEE Transactions on Image Processing, vol.5, issue.4, pp.565-574, 1996.
DOI : 10.1109/83.491333
, Rate-distortion performance for joint source and channel coding of images, Proc. Intl. Conf. Image Processing, pp.77-80, 1995.
, The Bayesian Choice. From Decision-Theoretic Foundations to Computational Implementation, 2001.
, Arithmetic coding for noisy channels, IEEE Information Theory Workshop, 1999.
, Iterating the Arimoto-Blahut algorithm for faster convergence, Proc. Intl. Conf. Inform. Theory, p.235, 2000.
, Use of residual redundancy in the design of joint source/channel coders, IEEE Transactions on Communications, vol.39, issue.6, pp.838-846, 1991.
DOI : 10.1109/26.87173
, More on the error recovery for variable-length codes, IEEE Transactions on Information Theory, vol.41, issue.6, pp.2064-2071, 1995.
DOI : 10.1109/18.476338
, Generalized Tunstall codes for sources with memory, IEEE Transactions on Information Theory, vol.43, issue.2, pp.658-668, 1997.
DOI : 10.1109/18.556121
, A mathematical theory of communication, Bell System Tech. J, vol.27, pp.379-423, 1948.
, Joint source/channel coding for variable length codes, IEEE Transactions on Communications, vol.48, issue.5, pp.787-794, 2000.
DOI : 10.1109/26.843191
, On the analysis of variable-to-variable length codes, Proceedings IEEE International Symposium on Information Theory,, 2002.
DOI : 10.1109/ISIT.2002.1023448
, Optimal decoding of entropy coded memoryless sources over noisy channels, Proc. Data Compression Conf, p.573, 1998.
, Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311), pp.446-450, 1999.
DOI : 10.1109/ICC.1999.767980
, Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes, Proc. Intl. Conf. Inform. Theory, p.370, 2000.
, High performance scalable image compression with EB- COT, IEEE Trans. Image Processing, vol.9, issue.7, pp.1158-1170, 1999.
, Subband image coding using entropy-coded quantization over noisy channels, IEEE Journal on Selected Areas in Communications, vol.10, issue.5, pp.926-942, 1992.
DOI : 10.1109/49.138998
, The synchronization of variable-length codes, IEEE Trans. Inform. Theory, vol.43, issue.2, pp.683-691, 1997.
, The complexity of minimum redundancy coding, Proc. Intl. Conf. Inform. Theory, p.373, 2000.
, Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis, IEEE Communications Letters, vol.7, issue.7, pp.787-794, 2003.
DOI : 10.1109/LCOMM.2003.814718
, Synthesis of noiseless compression codes, Georgia Institute of Technology, 1967.
, 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
, Error states and synchronization recovery for variable length codes, IEEE Transactions on Communications, vol.42, issue.2/3/4, pp.783-792, 1994.
DOI : 10.1109/TCOMM.1994.577107
, Reversible variable length codes, IEEE Transactions on Communications, vol.43, issue.2/3/4, pp.158-162, 1995.
DOI : 10.1109/26.380026
, Error bounds for convolution codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory, vol.13, issue.2, pp.260-269, 1967.
, Constructing codes with bounded codeword lengths
, Reduced-complexity soft-in-soft-out decoding of variable length codes, Proc. Intl. Conf. Inform. Theory, 2003.
, The String-to-String Correction Problem, Journal of the ACM, vol.21, issue.1, pp.168-173, 1974.
DOI : 10.1145/321796.321811
, Enhancements to the error resilient entropy code, 1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175), 1999.
DOI : 10.1109/MMSP.1998.738993
, On the characterization of statistically synchronizable codes (Corresp.), IEEE Transactions on Information Theory, vol.26, issue.6, pp.733-735, 1980.
DOI : 10.1109/TIT.1980.1056266
, Discrete cosine transform in error control coding, IEEE Trans. on Communications, vol.47, issue.4, pp.1065-1075, 1995.
, Reversible variable length codes for efficient and robust image and video coding, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), pp.471-480, 1998.
DOI : 10.1109/DCC.1998.672209
, Joint Source-Channel Coding for Image Transmission and Related Topics, 2003.
, A simple upper bound on the redundancy of Huffman codes, IEEE Trans. Inform. Theory, vol.48, issue.7, pp.2132-2138, 2002.
, Turbo codes for nonuniform memoryless sources over noisy channels, IEEE Commun. Lett, vol.6, pp.1253-1262, 2002.
, 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
, Pseudo-Gray coding, IEEE Transactions on Communications, vol.38, issue.12, pp.2147-2158, 1990.
DOI : 10.1109/26.64657
, 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
, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-343, 1978.
DOI : 10.1109/TIT.1978.1055934
, More on squaring and multiplying large integers, IEEE Trans. Comput, vol.43, issue.8, pp.899-908, 1994.
, Synchronization recovery of variable-length codes, IEEE Transactions on Information Theory, vol.48, issue.1, pp.219-227, 2002.
DOI : 10.1109/18.971750
, The source is the one given in Example 3.1. Multiplexed codes designed for the product alphabets {a 1 , a 2 , a 3 , a 4 , a 5 } n with n = 1, 2, 4, 6 have been considered. Compression efficiencies of the corresponding generalized Huffman codes are also depicted, p.78
, The IA methods used for the two codes are based on SA and crossed-IA+SA respectively. The figure also shows the SER and SNR curves obtained with arithmetic codes (AC). Hard, MPM and MMSE decoding techniques have been considered, p.109
, The figure shows the SER and SNR values obtained with the arithmetic codes with high priority sequences of length K H = 100 and K H = 1000. The multiplexed code considered relies on a lexicographic IA. The high priority sequence considered when the multiplexed code is used is K H = 1000. The correlation factor of the source is ? = 0, p.111