The Theory of Information and Coding
By Andrei V. Kelarev. 2005
502 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/83f9a971e84f124c05a78189cca9104c7858a2ec
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Pierre Baldi
- J. Urgen Schmidhuber
- Yoshua Bengio
- Wenguan Wang
- Ali Borji
- Dusist Niyato
- Kristen Grauman
- Kyunghyun Cho
Citations in the corpus
- Of Bits and Wows: A Bayesian Theory of Surprise with Applications to Attention (2009, methodology): “While several approaches for quantifying information have been proposed, the most prominent one so far has been Claude Shannon’s definition introduced over half a century ago (Aczel & Daroczy, 1975; Blahut, 1987; Cover & Thomas, 1991; McEliece, 1977; Shannon, 1948).”
- Visible light communication: Applications, architecture, standardization and research challenges (2017, methodology): “Linear block codes [26], convolutional codes [27] and the state of the art turbo codes [28] can be used to enhance the performance of the VLC system.”
- Ambient Backscatter Communications: A Contemporary Survey (2017, methodology): “In particular, based on the principle of the cyclic code [56], this technique encodes data by associating the code with polynomials.”
- Information Theory, Inference, and Learning Algorithms (2004, background): “A generalized channel coding theorem, including a cost function for the inputs, can be proved – see McEliece (1977). The result is a channel capacity C(v̄) that is a function of the permitted cost.”
- Bounds for the normalised Jensen functional (2006, unknown): “The following theorem is well known in the literature and concerns the maximum possible value of H(X) in terms of the size of R [5, p. 27] THEOREM 2.”
- Complex-Valued Autoencoders (2011, background): “For instance, the linear case over finite fields with noise added to the hidden layer, subsumes the theory of linear codes in coding theory (McEliece, 1977).”
- Boolean autoencoders and hypercube clustering complexity (2012, background): “8.4 Autoencoders, coding, and information theory Not surprisingly, autoencoders are closely related to the theory of information and coding [20].”
- Transporting information and energy simultaneously (2008, background): “This intuition is formalized for discrete memoryless channels, following [14].”