A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions

This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.

[1]  Amiel Feinstein,et al.  Transmission of Information. , 1962 .

[2]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[3]  Tobias Koch,et al.  Achieving Csiszár's source-channel coding exponent with product distributions , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[4]  Albert Guillén i Fàbregas,et al.  Ensemble-tight error exponents for mismatched decoders , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Fady Alajaji,et al.  Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory , 2007, IEEE Transactions on Information Theory.

[6]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[7]  Fady Alajaji,et al.  Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems , 2009, IEEE Transactions on Information Theory.

[8]  Richard E. Blahut,et al.  Hypothesis testing and information theory , 1974, IEEE Trans. Inf. Theory.

[9]  R. Rockafellar.  Conjugate Duality and Optimization , 1987 .

[10]  Tobias Koch,et al.  Joint Source-Channel Coding Revisited: Random-Coding Bounds and Error Exponents , 2013, ArXiv.

[11]  Tobias Koch,et al.  Random coding bounds that attain the joint source-channel exponent , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[12]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[13]  Edwin Hewitt,et al.  Real and Abstract Analysis: A Modern Treatment of the Theory of Functions of a Real Variable , 1965 .

[14]  Fady Alajaji,et al.  On the joint source-channel coding error exponent for discrete memoryless systems , 2006, IEEE Transactions on Information Theory.

[15]  Imre Csiszár.  On the error exponent of source-channel transmission with a distortion threshold , 1982, IEEE Trans. Inf. Theory.

[16]  O. F. Cook.  The Method of Types , 1898 .

[17]  M. Sion.  On general minimax theorems , 1958 .

[18]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[19]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[20]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .