DRDO – IISc Programme on Advanced Research in Mathematical Engineering Guessing Based On Length Functions ( TR-PME-2007-02 ) by
暂无分享,去创建一个
[1] Neri Merhav,et al. Universal coding with minimum probability of codeword length overflow , 1991, IEEE Trans. Inf. Theory.
[2] Michael Gutman,et al. Asymptotically optimal classification for multiple tests with empirically observed statistics , 1989, IEEE Trans. Inf. Theory.
[3] Kellen Petersen August. Real Analysis , 2009 .
[4] Erdal Arikan. An inequality on guessing and its application to sequential decoding , 1996, IEEE Trans. Inf. Theory.
[5] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[6] J. Ziv,et al. On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences , 1992, IEEE Trans. Inf. Theory.
[7] Rajesh Sundaresan,et al. Guessing Under Source Uncertainty , 2006, IEEE Transactions on Information Theory.
[8] Aaron D. Wyner,et al. An Upper Bound on the Entropy Series , 1972, Inf. Control..
[9] L. L. Campbell,et al. A Coding Theorem and Rényi's Entropy , 1965, Inf. Control..
[10] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[11] Neri Merhav,et al. Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.
[12] Neri Merhav,et al. The Shannon cipher system with a guessing wiretapper , 1999, IEEE Trans. Inf. Theory.
[13] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..