Competitive Minimax Universal Decoding for Several Ensembles of Random Codes
暂无分享,去创建一个
[1] Neri Merhav,et al. When is the generalized likelihood ratio test optimal? , 1992, IEEE Trans. Inf. Theory.
[2] Andrew J. Viterbi,et al. Principles of Digital Communication and Coding , 1979 .
[3] Meir Feder,et al. Universal decoders for channels with memory , 1996 .
[4] Neri Merhav,et al. Minimax Universal Decoding With an Erasure Option , 2007, IEEE Transactions on Information Theory.
[5] Imre Csiszár. Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.
[6] Neri Merhav,et al. Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.
[7] Meir Feder,et al. Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.
[8] Neri Merhav,et al. Universal Decoding With an Erasure Option , 2007, 2007 IEEE International Symposium on Information Theory.
[9] Amos Lapidoth,et al. On the Universality of the LZ-Based Decoding Algorithm , 1998, IEEE Trans. Inf. Theory.
[10] Neri Merhav,et al. Achievable Error Exponents for the Private Fingerprinting Game , 2007, IEEE Transactions on Information Theory.
[11] Jacob Ziv,et al. Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.
[12] Nadav Shulman,et al. Communication over an unknown channel via common broadcasting , 2003 .