Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference38 articles.
1. Nakiboğlu, B., The Augustin Center and the Sphere Packing Bound for Memoryless Channels, Proc. 2017 IEEE Int. Sympos. on Information Theory (ISIT’2017), Aachen, Germany, June 25–30, 2017, pp. 1401–1405.
2. Csiszár, I., Generalized Cutoff Rates and Rényi’s Information Measures, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 1, pp. 26–34.
3. Dalai, M., Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rányi vs. Kullback-Leibler, Entropy, 2017, vol. 19, no. 7, pp. 355 (11 pp.).
4. Mosonyi, M. and Ogawa, T., Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding with Constant Compositions, arXiv:1811.10599v4 [quant-ph], 2018.
5. Csiszár, I. and Körner, J., Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge, UK: Cambridge Univ. Press, 2011, 2nd ed. First edition translated under the title Teoriya informatsii: teoremy kodirovaniya dlya diskretnykh sistem bez pamyati, Moscow: Mir, 1985.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献