A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code
暂无分享,去创建一个
[1] Neri Merhav,et al. Large Deviations Behavior of the Logarithmic Error Probability of Random Codes , 2019, IEEE Transactions on Information Theory.
[2] Ali Nazari. Error Exponent for Discrete Memoryless Multiple-Access Channels. , 2011 .
[3] Neri Merhav,et al. Error Exponents of Typical Random Trellis Codes , 2019, IEEE Transactions on Information Theory.
[4] Albert Guillén i Fàbregas,et al. The likelihood decoder: Error exponents and mismatch , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[5] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.
[6] Gerard Battail. On Random-Like Codes , 1995, Information Theory and Applications.
[7] Neri Merhav,et al. Error Exponents of Typical Random Codes for the Colored Gaussian Channel , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).
[8] Neri Merhav,et al. Error Exponents of Typical Random Codes , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).
[9] Sergio Verdú,et al. On α-decodability and α-likelihood decoder , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[10] V.W.S. Chan,et al. Principles of Digital Communication and Coding , 1979 .
[11] Amin Gohari,et al. A technique for deriving one-shot achievability results in network information theory , 2013, 2013 IEEE International Symposium on Information Theory.
[12] H. Vincent Poor,et al. The Likelihood Encoder for Lossy Compression , 2014, IEEE Transactions on Information Theory.
[13] Young-Han Kim,et al. Variations on a Theme by Liu, Cuff, and Verdú: The Power of Posterior Sampling , 2018, 2018 IEEE Information Theory Workshop (ITW).
[14] Neri Merhav,et al. The generalized stochastic likelihood decoder: Random coding and expurgated bounds , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).
[15] Achilleas Anastasopoulos,et al. Error Exponent for Multiple Access Channels: Upper Bounds , 2015, IEEE Transactions on Information Theory.