Typicality graphs and their properties
暂无分享,去创建一个
Achilleas Anastasopoulos | Ali Nazari | Ramji Venkataramanan | S. Sandeep Pradhan | Dinesh Krithivasan
[1] Achilleas Anastasopoulos,et al. New bounds on the maximal error exponent for multiple-access channels , 2009, 2009 IEEE International Symposium on Information Theory.
[2] S. Sandeep Pradhan,et al. A Graph-Based Framework for Transmission of Correlated Sources Over Broadcast Channels , 2006, IEEE Transactions on Information Theory.
[3] Kannan Ramchandran,et al. A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.
[4] Ramji Venkataramanan,et al. A new achievable rate region for the discrete memoryless multiple-access channel with feedback , 2009, 2009 IEEE International Symposium on Information Theory.
[5] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[6] Achilleas Anastasopoulos,et al. A new sphere-packing bound for maximal error exponent for multiple-access channels , 2008, 2008 IEEE International Symposium on Information Theory.
[7] Svante Janson,et al. New versions of Suen's correlation inequality , 1998, Random Struct. Algorithms.
[8] Peter Harremoës,et al. Refinements of Pinsker's inequality , 2003, IEEE Trans. Inf. Theory.
[9] R. Ahlswede. An elementary proof of the strong converse theorem for the multiple-access channel , 1982 .
[10] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.