Entanglement-Assisted Zero-Error Source-Channel Coding
暂无分享,去创建一个
[1] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[2] C. H. Bennett,et al. Remote state preparation. , 2000, Physical review letters.
[3] Debbie W. Leung,et al. Improving zero-error classical communication with entanglement , 2009, Physical review letters.
[4] Zheng-Feng Ji,et al. Binary Constraint System Games and Locally Commutative Reductions , 2013, ArXiv.
[5] Harry Buhrman,et al. Violating the Shannon capacity of metric graphs with entanglement , 2012, Proceedings of the National Academy of Sciences.
[6] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[7] J. S. BELLt. Einstein-Podolsky-Rosen Paradox , 2018 .
[8] Noga Alon,et al. Graph Powers , 2002 .
[9] J. Seberry,et al. New constructing of regular Hadamard matrices , 2006 .
[10] S. Severini,et al. New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring , 2012, IEEE Transactions on Information Theory.
[11] Qing Xiang. Difference Families From Lines and Half Lines , 1998, Eur. J. Comb..
[12] Sergio Verdú,et al. The source-channel separation theorem revisited , 1995, IEEE Trans. Inf. Theory.
[13] Donald E. Knuth. The Sandwich Theorem , 1994, Electron. J. Comb..
[14] Noga Alon,et al. The Shannon Capacity of a Union , 1998, Comb..
[15] David E. Roberson,et al. Graph Homomorphisms for Quantum Players , 2014, TQC.
[16] Richard M. Wilson,et al. Constructions of Hadamard Difference Sets , 1997, J. Comb. Theory, Ser. A.
[17] M. Laurent. THE OPERATOR FOR THE CHROMATIC NUMBER OF AGRAPH , 2008 .
[18] Simone Severini,et al. On the Quantum Chromatic Number of a Graph , 2007, Electron. J. Comb..
[19] H. S. WITSENHAUSEN,et al. The zero-error side information problem and chromatic numbers (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[20] Kenneth Rose,et al. Zero-Error Source-Channel Coding With Side Information , 2006, IEEE Trans. Inf. Theory.
[21] Simone Severini,et al. Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number , 2010, IEEE Transactions on Information Theory.
[22] Simone Severini,et al. New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring , 2013, IEEE Transactions on Information Theory.
[23] Noga Alon,et al. The Shannon capacity of a graph and the independence numbers of its powers , 2006, IEEE Transactions on Information Theory.
[24] Parikshit Gopalan. Constructing Ramsey graphs from Boolean function representations , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[25] Mario Szegedy. A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[26] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[27] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[28] Albert Einstein,et al. Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .
[29] D. Leung,et al. Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels , 2010, Communications in Mathematical Physics.
[30] David E. Roberson,et al. Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants , 2013, IEEE Transactions on Information Theory.
[31] Yu Qing Chen. On the Existence of Abelian Hadamard Difference Sets and a New Family of Difference Sets , 1997 .
[32] David E. Roberson,et al. Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants , 2014, TQC.
[33] Gang Liu,et al. An infinite class of supplementary difference sets and Williamson matrices , 1991, J. Comb. Theory, Ser. A.
[34] Monique Laurent,et al. The Operator Psi for the Chromatic Number of a Graph , 2008, SIAM J. Optim..
[35] Alon Orlitsky,et al. Zero-Error Information Theory , 1998, IEEE Trans. Inf. Theory.
[36] M. Behbahani. On orthogonal matrices , 2004 .
[37] Robert W. Spekkens,et al. Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol , 2002, Quantum Inf. Comput..
[38] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[39] David A. Mix Barrington,et al. Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.
[40] Salman Beigi,et al. Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function , 2010, ArXiv.
[41] Mingyuan Xia,et al. A new family of supplementary difference sets and Hadamard matrices , 1996 .
[42] Shubhangi Saraf,et al. Locally Decodable Codes , 2016, Encyclopedia of Algorithms.
[43] Kenneth Rose,et al. On zero-error coding of correlated sources , 2003, IEEE Trans. Inf. Theory.
[44] A. Winter,et al. Bounds on entanglement assisted source-channel coding via the lovász number and its variants , 2014 .
[45] Michael O. Albertson,et al. Homomorphisms of 3-chromatic graphs , 1985, Discret. Math..