Fetching the paper…
Reading the bibliography…
Most communication channels are subjected to noise.
Claude E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal 27
1948
Earlier work this paper cites.
RL Dobrushin, “General formulation of shannon’s main theorem in information theory,” Amer. Math. Soc. Trans 33
1963
Earlier work this paper cites.
RL Dobrushin, “General formulation of shannon’s main theorem in information theory,” Amer. Math. Soc. Trans 33
1963
Earlier work this paper cites.
Wassily Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American statistical association 58
1963
Earlier work this paper cites.
Go-Din Hu, “On shannon theorem and its converse for sequence of communication schemes in the case of abstract random variables,” in Trans. 3rd Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Czechslovak Academy of Sciences, Prague (1964) pp. 285–333
1964
Earlier work this paper cites.
Seymour Ginsburg, The Mathematical Theory of Context Free Languages.[Mit Fig.] (McGraw-Hill Book Company, 1966)
1966
Earlier work this paper cites.
Seymour Ginsburg, The Mathematical Theory of Context Free Languages.[Mit Fig.] (McGraw-Hill Book Company, 1966)
1966
Earlier work this paper cites.
Rudolf Ahlswede, “The weak capacity of averaged channels,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 11
1968
Earlier work this paper cites.
Robert G Gallager, Information theory and reliable communication , Vol. 2 (Springer, 1968)
1968
Earlier work this paper cites.
Robert G Gallager, Information theory and reliable communication , Vol. 2 (Springer, 1968)
1968
Earlier work this paper cites.
Karel Winkelbauer, “On the coding theorem for decomposable discrete information channels. i,” Kybernetika 7
1971
Earlier work this paper cites.
Azaria Paz, Introduction to probabilistic automata (Academic Press, Inc., Orlando, FL, USA, 1971)
1971
Earlier work this paper cites.
Azaria Paz, Introduction to probabilistic automata (Academic Press, Inc., Orlando, FL, USA, 1971)
1971
Earlier work this paper cites.
Richard E Blahut, “Computation of channel capacity and rate-distortion functions,” Information Theory, IEEE Transactions on 18
1972
Earlier work this paper cites.
Suguru Arimoto, “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” Information Theory, IEEE Transactions on 18
1972
Earlier work this paper cites.
John C Kieffer, “A general formula for the capacity of stationary nonanticipatory channels,” Information and Control 26
1974
Earlier work this paper cites.
David Singmaster, Notes on Rubik’s magic cube (Enslow Pub Inc, 1981)
1981
Earlier work this paper cites.
Mordechai Mushkin and Israel Bar-David, “Capacity and coding for the gilbert-elliott channels,” Information Theory, IEEE Transactions on 35
1989
Cited alongside, same era.
Anne Condon and Richard J Lipton, “On the complexity of space bounded interactive proofs,” in Foundations of Computer Science, 1989., 30th Annual Symposium on (IEEE, 1989) pp. 462–467
1989
Cited alongside, same era.
Anne Condon and Richard J Lipton, “On the complexity of space bounded interactive proofs,” in Foundations of Computer Science, 1989., 30th Annual Symposium on (IEEE, 1989) pp. 462–467
1989
Cited alongside, same era.
Sergio Verdu and Te Han, “A general formula for channel capacity,” Information Theory, IEEE Transactions on 40
1994
Cited alongside, same era.
Sergio Verdu and Te Han, “A general formula for channel capacity,” Information Theory, IEEE Transactions on 40
1994
Mika Hirvensalo, “Improved undecidability results on the emptiness problem of probabilistic and quantum cut-point languages,” in SOFSEM 2007: Theory and Practice of Computer Science (Springer, 2007) pp. 309–319
2007
Later among the works it cites.
Pascal O Vontobel, Aleksandar Kavcic, Dieter-Michael Arnold, and H-A Loeliger, “A generalization of the blahut–arimoto algorithm to finite-state channels,” Information Theory, IEEE Transactions on 54
2008
Later among the works it cites.
Sanjeev Arora and Boaz Barak, Computational complexity: a modern approach (Cambridge University Press, 2009)
2009
Later among the works it cites.
Hugo Gimbert and Youssouf Oualhadj, Automates probabilistes: problémes décidables et indécidables , Tech. Rep. (RR-1464-09 LaBRI, 2009)
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Andrea J Goldsmith and Pravin P Varaiya, “Capacity, mutual information, and coding for finite-state markov channels,” Information Theory, IEEE Transactions on 42
1996
Cited alongside, same era.
Noga Alon, “The shannon capacity of a union,” Combinatorica 18
1998
Cited alongside, same era.
Henry D Pfister, Joseph B Soriaga, and Paul H Siegel, “On the achievable information rates of finite state isi channels,” in Global Telecommunications Conference, 2001. GLOBECOM’01. IEEE , Vol. 5 (IEEE, 2001) pp. 2992–2996
2001
Cited alongside, same era.
Vinod Sharma and SK Singh, “Entropy and channel capacity in the regenerative setup with applications to markov channels,” in Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on (IEEE, 2001) p. 283
2001
Cited alongside, same era.
Aleksandar Kavčić, “On the capacity of markov sources over noisy channels,” in Global Telecommunications Conference, 2001. GLOBECOM’01. IEEE , Vol. 5 (IEEE, 2001) pp. 2997–3001
2001
Cited alongside, same era.
Graham James Oscar Jameson, The prime number theorem , Vol. 53 (Cambridge University Press, 2003)
2003
Cited alongside, same era.
Vincent D Blondel, Vincent Canterini, et al. , “Undecidable problems for probabilistic automata of fixed dimension,” Theory of Computing systems 36
2003
Cited alongside, same era.
2010
Later among the works it cites.
Hugo Gimbert and Youssouf Oualhadj, “Probabilistic automata on finite words: Decidable and undecidable problems,” in Automata, Languages and Programming (Springer, 2010) pp. 527–538
2010
Later among the works it cites.
Hugo Gimbert and Youssouf Oualhadj, “Probabilistic automata on finite words: Decidable and undecidable problems,” in Automata, Languages and Programming (Springer, 2010) pp. 527–538
2010
Later among the works it cites.
Jianxin Chen, Toby S Cubitt, Aram W Harrow, and Graeme Smith, “Entanglement can completely defeat quantum noise,” Physical review letters 107
2011
Later among the works it cites.
Toby S Cubitt, Jianxin Chen, and Aram W Harrow, “Superactivation of the asymptotic zero-error classical capacity of a quantum channel,” Information Theory, IEEE Transactions on 57
2011
Later among the works it cites.
Toby S Cubitt and Graeme Smith, “An extreme form of superactivation for quantum zero-error capacities,” Information Theory, IEEE Transactions on 58
2012
Later among the works it cites.
Guangyue Han, “A randomized algorithm for the capacity of finite-state channels,” Information Theory, IEEE Transactions on 61
2015
Later among the works it cites.
Turlough Neary and Nicolas Ollinger, “Undecidability in binary tag systems and the post correspondence problem for five pairs of words,” in 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) , Vol. 30 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015) pp. 649–661
2015
Later among the works it cites.
Toby Cubitt, David Elkouss, William Matthews, Maris Ozols, David Perez-Garcia, and Sergii Strelchuk, “Unbounded number of channel uses are required to see quantum capacity,” Nature Communications 6
2015
Later among the works it cites.
David Elkouss and Sergii Strelchuk, “Superadditivity of private information for any number of uses of the channel,” Physical Review Letters 115
2015
Later among the works it cites.
David Elkouss and David Perez-Garcia, In preparation (2017)
2017
Closest in time.
ME Shirokov, “On channels with positive quantum zero-error capacity having vanishing n-shot capacity,” Quantum Information Processing , 1–18 (2014)
2020
Closest in time.