Foundations of Information Theory
Reads0
Chats0
About:
This article is published in American Mathematical Monthly.The article was published on 1959-08-01 and is currently open access. It has received 202 citations till now. The article focuses on the topics: Information theory.read more
Citations
More filters
Journal ArticleDOI
Three-terminal communication channels
TL;DR: A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived and upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
Journal ArticleDOI
On the Length of Programs for Computing Finite Binary Sequences
TL;DR: An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences.
Book
A First Course in Information Theory
TL;DR: This book provides the first comprehensive treatment of the theory of I-Measure, network coding theory, Shannon and non-Shannon type information inequalities, and a relation between entropy and group theory.
Journal ArticleDOI
Recent advances in the construction of polygonal finite element interpolants
N. Sukumar,E. A. Malsch +1 more
TL;DR: This survey focuses specifically on polygonal shape functions that satisfy the properties of barycentric coordinates: form a partition of unity, and are non-negative; interpolate nodal data (Kronecker-delta property), and are smooth within the domain.
Journal ArticleDOI
Construction of polygonal interpolants: a maximum entropy approach
TL;DR: In this article, a link between maximizing entropy and the construction of polygonal interpolants is established, and the maximum entropy formulation leads to a feasible solution for ϕi in any convex or non-convex polygon.
References
More filters
Journal ArticleDOI
Three-terminal communication channels
TL;DR: A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived and upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
Journal ArticleDOI
On the Length of Programs for Computing Finite Binary Sequences
TL;DR: An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences.
Book
A First Course in Information Theory
TL;DR: This book provides the first comprehensive treatment of the theory of I-Measure, network coding theory, Shannon and non-Shannon type information inequalities, and a relation between entropy and group theory.
Journal ArticleDOI
Recent advances in the construction of polygonal finite element interpolants
N. Sukumar,E. A. Malsch +1 more
TL;DR: This survey focuses specifically on polygonal shape functions that satisfy the properties of barycentric coordinates: form a partition of unity, and are non-negative; interpolate nodal data (Kronecker-delta property), and are smooth within the domain.
Journal ArticleDOI
Construction of polygonal interpolants: a maximum entropy approach
TL;DR: In this article, a link between maximizing entropy and the construction of polygonal interpolants is established, and the maximum entropy formulation leads to a feasible solution for ϕi in any convex or non-convex polygon.