Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders
暂无分享,去创建一个
[1] Imre Csiszár. Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.
[2] Meir Feder,et al. Universal decoders for channels with memory , 1996 .
[3] Neri Merhav,et al. Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.
[4] Meir Feder,et al. Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.
[5] Jacob Ziv,et al. Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.
[6] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[7] Neri Merhav,et al. Minimax Universal Decoding With an Erasure Option , 2007, IEEE Transactions on Information Theory.
[8] Amos Lapidoth,et al. On the Universality of the LZ-Based Decoding Algorithm , 1998, IEEE Trans. Inf. Theory.
[9] Neri Merhav,et al. Achievable Error Exponents for the Private Fingerprinting Game , 2007, IEEE Transactions on Information Theory.
[10] Neri Merhav,et al. When is the generalized likelihood ratio test optimal? , 1992, IEEE Trans. Inf. Theory.