Minimax Universal Decoding With an Erasure Option
暂无分享,去创建一个
[1] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .
[2] Takeshi Hashimoto,et al. Performance of explicit error detection and threshold decision in decoding with erasures , 1997, IEEE Trans. Inf. Theory.
[3] Neri Merhav,et al. Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.
[4] Michael Luby,et al. A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.
[5] M. Feder,et al. Static broadcasting , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[6] J. Massey. CAUSALITY, FEEDBACK AND DIRECTED INFORMATION , 1990 .
[7] Brendan J. Frey,et al. Efficient variable length channel coding for unknown DMCs , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[8] Meir Feder,et al. Universal decoders for channels with memory , 1996 .
[9] Frank R. Kschischang,et al. Rateless Coding for Non-Ergodic Channels with Decoder Channel State Information , 2006 .
[10] James L. Massey,et al. Conservation of mutual and directed information , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[11] Meir Feder,et al. Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.
[12] Michael Mitzenmacher,et al. A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..
[13] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[14] Emre Telatar,et al. Variable length coding over an unknown channel , 2006, IEEE Transactions on Information Theory.
[15] Andrew J. Viterbi,et al. Error bounds for the white Gaussian and other very noisy memoryless channels with generalized decision regions , 1969, IEEE Trans. Inf. Theory.
[16] Jacob Ziv,et al. Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.
[17] Rudolf Ahlswede,et al. Erasure, list, and detection zero-error capacities for low noise and a relation to identification , 1996, IEEE Trans. Inf. Theory.
[18] Krishna R. Narayanan,et al. Multilevel Coding for Channels with Non-uniform Inputs and Rateless Transmission over the BSC , 2006, 2006 IEEE International Symposium on Information Theory.
[19] Takeshi Hashimoto,et al. Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule , 1999, IEEE Trans. Inf. Theory.
[20] Nadav Shulman,et al. Communication over an unknown channel via common broadcasting , 2003 .
[21] Gregory W. Wornell,et al. Rateless space-time coding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[22] G. David Forney,et al. Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.
[23] Meir Feder,et al. The uniform distribution as a universal prior , 2004, IEEE Transactions on Information Theory.