A First Course in Information Theory
By Raymond W. Yeung. 2002
580 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/6ea9c1998b4f932b741083928049ff9bc286d68b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Maya R. Gupta
- Yihua Chen
- Qiang Qiu
- Sándor Imre
- Laszlo Gyongyosi
- Hung Viet Nguyen
- Imre Csiszár
- Guillermo Sapiro
In Computational Theory and Mathematics
- Muriel Médard
- Michelle Effros
- Yunnan Wu
- Ralf Koetter
- Raymond W. Yeung
- Yihua Chen
- Maya R. Gupta
- P. Chou
In Statistics and Probability
- Yihua Chen
- Maya R. Gupta
- Sándor Imre
- Laszlo Gyongyosi
- Hung Viet Nguyen
- Imre Csiszár
- Muriel Médard
- Ralf Koetter
Citations in the corpus
- Axiomatic Characterizations of Information Measures (2008, background): “We mention only the following key results: For N ≥ 4, the closure of the class of " entropic " set functions is a proper subclass of polymatroids, Zhang-Yeung [60].”
- A Survey on Quantum Channel Capacities (2018, methodology): “A good introduction to Information Theory can be found in the work of Yeung [544].”
- Theory and Use of the EM Algorithm (2011, methodology): “This class of methods also includes projection onto convex sets (POCS) and the Blahut–Arimoto algorithms; for more details on this class of algorithms, we recommend Stark and Yang’s book [55] and Yeung’s book [64].”
- Minimum-energy multicast in mobile ad hoc networks using network coding (2004, background): “, rm) remains an open problem in information theory; see [26].”
- Capacity of wireless erasure networks (2006, result): “By an approach similar to [5], [7], [20] (Section 11.”
- Adversarially Learned Representations for Information Obfuscation and Inference (2019, methodology): “Proof: Consider the following equality, derived from properties of Shannon Information, see (Yeung, 2012).”
- An algebraic approach to network coding (2001, background): “The set of achievable connections is there bounded within Yeung’s framework of information inequalities [ 12 ].”
- Network coding theory (2006, background): “5 bits per unit time, which is actually the maximum possible when the intermediate nodes perform just bit replication (See [209], Ch.”
- A Conceptual Typology of Multitasking Behavior and Polychronicity Preferences (2012, background): “…the informationtheoretic concept of “entropy” (disorder, uncertainy) may offer a useful means for quantifying and classifying activity patterns (see Yeung, 2002 for an introduction, and Leslie et al., 2007 for a spatial application; and although the authors did not employ this concept, entropy…”
- Comprehensive splice-site analysis using comparative genomics (2006, background): “Each position on the splice site has an associated information content that can be derived from the frequencies of the 4 nt, using information theory (37,38).”