Fetching the paper…
Reading the bibliography…
Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error.
C. E. Shannon, Bell Syst. Tech. J. 27:379-423 & 623-656 (1948)
1948
Earlier work this paper cites.
C. E. Shannon, IRE Trans. Inform. Theory, vol. IT-2(3):8-19 (1956)
1956
Earlier work this paper cites.
J. S. Bell, Physics 1:195-200 (1964)
1964
Earlier work this paper cites.
S. Kochen, E. P. Specker, J. Math. Mechanics 17:59-87 (1967)
1967
Earlier work this paper cites.
L. Lovász, IEEE Trans. Inf. Theory 25:1-7 (1979)
1979
Earlier work this paper cites.
A. Peres, J. Phys. A: Math. Gen. 24(4):L175-L178 (1991)
1991
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters, Phys. Rev. Lett. 70:1895-1899 (1993)
1993
Earlier work this paper cites.
S. Popescu, D. Rohrlich, Found. Phys. 24:379-385 (1994)
1994
Cited alongside, same era.
J. Körner, A. Orlitsky, IEEE Trans. Inf. Theory 44(6):2207-2229 (1998)
1998
Cited alongside, same era.
G. Brassard, R. Cleve, A. Tapp, Phys. Rev. Lett. 83:1874-1877 (1999)
1999
Cited alongside, same era.
C. H. Bennett, P. W. Shor, J. A. Smolin, A. V. Thapliyal, IEEE Trans. Inf. Theory 48:2637-2655 (2002)
2002
Cited alongside, same era.
R. Renner, S. Wolf, Proc. of Int’l Symp. Inform. Theory (ISIT), p. 322 (2004)
2004
Cited alongside, same era.
R. A. C. Medeiros, R. Alleaume, G. Cohen, F. M. de Assis, arXiv:quant-ph/0611042 (2006)
2006
Cited alongside, same era.
R. Duan, arXiv:0906.2527 (2009)
2009
Closest in time.
T. S. Cubitt, J. Chen, A. W. Harrow, arXiv:0906.2547 (2009)
2009
Closest in time.
T. S. Cubitt, G. Smith, arXiv:0912.2737 (2009)
2009
Closest in time.
T. S. Cubitt, D. Leung, W. Matthews, A. Winter, in preparation, accepted at QIP 2010
2010
Closest in time.
S. Beigi, arXiv:1002.2488 (2010)
2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
See, for example, A. Schrijver, Combinatorial optimization: polyhedra and efficiency , Vol. 1, p. 1429, where it is called the “fractional stable set number” of a hypergraph
Cited in the paper.
2010
Closest in time.