The Shannon capacity of a graph and the independence numbers of its powers
暂无分享,去创建一个
[1] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[2] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[3] Willem H. Haemers,et al. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.
[4] Alexander Schrijver,et al. A comparison of the Delsarte and Lovász bounds , 1979, IEEE Trans. Inf. Theory.
[5] R. Douglas. On majorization, factorization, and range inclusion of operators on Hilbert space , 1966 .
[6] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[7] Noga Alon,et al. Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..
[8] C. Baker. Joint measures and cross-covariance operators , 1973 .
[9] N. Alon,et al. The Probabilistic Method, Second Edition , 2000 .
[10] F. Hansen,et al. Jensen's inequality for operators and Löwner's theorem , 1982 .
[11] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[12] Noga Alon,et al. Repeated communication and Ramsey graphs , 1995, IEEE Trans. Inf. Theory.
[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[14] Tom Bohman. A limit theorem for the Shannon capacities of odd cycles. II , 2003 .
[15] T. Andô,et al. Means of positive linear operators , 1980 .
[16] Thomas M. Cover,et al. Gaussian feedback capacity , 1989, IEEE Trans. Inf. Theory.
[17] Noga Alon,et al. The Shannon Capacity of a Union , 1998, Comb..
[18] Ron Holzman,et al. A nontrivial lower bound on the Shannon capacities of the complements of odd cycles , 2003, IEEE Trans. Inf. Theory.