Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding

We consider the problem of coded communication, where in each time frame, the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. We derive the optimum detection/decoding rule in the sense of the best tradeoff among the probabilities of decoding error, false alarm, and misdetection. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these probabilities for the average code in the ensemble. It is shown that previously proposed decoders are in general strictly suboptimal.

[1]  Neri Merhav,et al.  List Decoding—Random Coding Exponents and Expurgated Exponents , 2013, IEEE Transactions on Information Theory.

[2]  Neri Merhav.  Universal decoding for memoryless Gaussian channels with a deterministic interference , 1993, IEEE Trans. Inf. Theory.

[3]  Sae-Young Chung,et al.  Error exponents in asynchronous communication , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Robert A. Scholtz,et al.  Frame Synchronization Techniques , 1980, IEEE Trans. Commun..

[5]  Meir Feder,et al.  Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.

[6]  Lizhong Zheng,et al.  Unequal Error Protection: An Information-Theoretic Perspective , 2008, IEEE Transactions on Information Theory.

[7]  Gregory W. Wornell,et al.  Optimal Sequential Frame Synchronization , 2007, IEEE Transactions on Information Theory.

[8]  L. Franks,et al.  Carrier and Bit Synchronization in Data Communication - A Tutorial Review , 1980, IEEE Transactions on Communications.

[9]  David Tse,et al.  Asynchronous Capacity per Unit Cost , 2010, IEEE Transactions on Information Theory.

[10]  Neri Merhav,et al.  Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.

[11]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[12]  Xiaodong Wang,et al.  Joint Detection and Estimation: Optimum Tests and Applications , 2011, IEEE Transactions on Information Theory.

[13]  Neri Merhav,et al.  Achievable Error Exponents for the Private Fingerprinting Game , 2007, IEEE Transactions on Information Theory.

[14]  J. Massey,et al.  Optimum Frame Synchronization , 1972, IEEE Trans. Commun..

[15]  Neri Merhav,et al.  Exact Random Coding Exponents for Erasure Decoding , 2011, IEEE Transactions on Information Theory.

[16]  George V. Moustakides,et al.  Optimum joint detection and estimation , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Gregory W. Wornell,et al.  Asynchronous Communication: Capacity Bounds and Suboptimality of Training , 2013, IEEE Transactions on Information Theory.

[19]  Li Peng,et al.  Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections , 2013, IEEE Transactions on Information Theory.

[20]  Nadav Shulman,et al.  Communication over an unknown channel via common broadcasting , 2003 .

[21]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[22]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[23]  Gregory W. Wornell,et al.  Communication Under Strong Asynchronism , 2007, IEEE Transactions on Information Theory.

[24]  Steven W. McLaughlin,et al.  Reliable Communication Under Channel Uncertainty , 2000 .

[25]  Neri Merhav,et al.  Asymptotically Optimal Decision Rules for Joint Detection and Source Coding , 2013, IEEE Transactions on Information Theory.