Fetching the paper…
Reading the bibliography…
It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver.
A mathematical theory of communication
Claude E. Shannon · 1948
Earlier work this paper cites.
The zero error capacity of a noisy channel
Claude E. Shannon · 1956
Earlier work this paper cites.
Lower bounds to error probability for coding on discrete memoryless channels. I
Claude E. Shannon, Robert G. Gallager, and Elwyn R. Berlekamp · 1967
Earlier work this paper cites.
Partitions and their stabilizers for line complexes and quadrics
Roger H. Dye · 1977
Earlier work this paper cites.
An upper bound for the Shannon capacity of a graph
Willem H. Haemers · 1978
Earlier work this paper cites.
On the Shannon capacity of a graph
László Lovász · 1979
Earlier work this paper cites.
On some problems of Lovász concerning the Shannon capacity of a graph
Willem H. Haemers · 1979
Earlier work this paper cites.
Reflection groups and Coxeter groups
James E. Humphreys · 1992
Earlier work this paper cites.
Orthogonal representations over finite fields and the chromatic number of graphs
René Peeters · 1996
Earlier work this paper cites.
Zero-error information theory
János Körner and Alon Orlitsky · 1998
Cited alongside, same era.
The diameters graph of the root system E 8 {E}_{8} is uniquely geometrisable
Pratima Panigrahi · 1999
Cited alongside, same era.
Mutually unbiased binary observable sets on N N qubits
Jay Lawrence, Časlav Brukner, and Anton Zeilinger · 2002
Cited alongside, same era.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 2002
Cited alongside, same era.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal · 2002
Cited alongside, same era.
Symplectic spreads
Simeon Ball, John Bamberg, Michel Lavrauw, and Tim Penttila · 2004
Cited alongside, same era.
A new proof for the existence of mutually unbiased bases
Somshubhro Bandyopadhyay, Oscar P. Boykin, Vwani Roychowdhury, and Farrokh Vatan · 2008
Later among the works it cites.
Compression of root systems and the E E -sequence
Kevin Purbhoo · 2008
Later among the works it cites.
Improving zero-error classical communication with entanglement
Toby S. Cubitt, Debbie Leung, William Matthews, and Andreas Winter · 2010
Closest in time.
Entanglement-assisted zero-error capacity is upper bounded by the Lovász theta function, 2010
Salman Beigi · 2010
Closest in time.
Runyao Duan, Simone Severini, and Andreas Winter · 2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Introduction to Lie algebras
Karin Erdmann and Mark J. Wildon · 2006
Cited alongside, same era.
Exceptional and non-crystallographic root systems and the Kochen–Specker theorem
Artur E. Ruuge · 2007
Cited alongside, same era.
Zero-error channel capacity and simulation assisted by non-local correlations, 2010
Toby S. Cubitt, Debbie Leung, William Matthews, and Andreas Winter · 2010
Closest in time.
From qubits to E 7 {E}_{7} , 2010
Bianca L. Cerchiai and Bert van Geemen · 2010
Closest in time.
Entanglement-enhanced classical communication over a noisy classical channel, 2010
Robert Prevedel, Yang Lu, William Matthews, Rainer Kaltenbaek, and Kevin J. Resch · 2010
Closest in time.