暂无分享,去创建一个
[1] Kannan Ramchandran,et al. Fundamental limits of DNA storage systems , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[2] Daniela Tuninetti,et al. The Strongly Asynchronous Massive Access Channel , 2018, Entropy.
[3] Martin J. Wainwright,et al. Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery , 2018, IEEE Transactions on Information Theory.
[4] Vincent Y. F. Tan,et al. Bee-Identification Error Exponent with Absentee Bees , 2019, 2020 IEEE International Symposium on Information Theory (ISIT).
[5] Martin Middendorf,et al. Automated monitoring of behavior reveals bursty interaction patterns and rapid spreading dynamics in honeybee social networks , 2018, Proceedings of the National Academy of Sciences.
[6] Neri Merhav,et al. Large Deviations Behavior of the Logarithmic Error Probability of Random Codes , 2019, IEEE Transactions on Information Theory.
[7] Daniela Tuninetti,et al. On Identifying a Massive Number of Distributions , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[8] Vincent Y. F. Tan,et al. The Bee-Identification Problem: Bounds on the Error Exponent , 2019, IEEE Transactions on Communications.
[9] Neri Merhav,et al. The generalized stochastic likelihood decoder: Random coding and expurgated bounds , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).
[10] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.
[11] Achilleas Anastasopoulos,et al. Error Exponent for Multiple Access Channels: Upper Bounds , 2015, IEEE Transactions on Information Theory.
[12] Neri Merhav,et al. Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes , 2020, ArXiv.
[13] Neri Merhav,et al. The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code , 2020, ArXiv.
[14] Robert G. Gallager,et al. A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.
[15] Neri Merhav,et al. Error Exponents of Typical Random Codes , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).
[16] Ilan Shomorony,et al. Capacity Results for the Noisy Shuffling Channel , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).