This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.

What a channel can carry

A subject the papers are about. The loosest grouping, and the one to reach for last.

How much a channel can carry, and why noise is the limit. Shannon's 1948 paper is the subject; Nyquist and Hartley are here as the bounds that preceded it without a noise term, and the later work as what was built on it. Membership turns on the capacity of the channel itself, not on codes or protocols that use it.

11 references

A Logarithmic Decomposition and a Signed Measure Space for Entropy
Keenan J. A. Down and others (2024) · arXiv
On the capacity of optical backbone networks
João J. O. Pires (2024) · Network
Information Theory: A Tutorial Introduction
James V. Stone (2018) · arXiv
Entropy and Information Theory
Robert M. Gray (2011) · Springer US
Nonlinear limits to the information capacity of optical fibre communications
Partha P. Mitra and others (2001) · Nature · Springer Science and Business Media LLC
Internetting or Beyond NCP
Danny Cohen (1977) · Information Sciences Institute, University of Southern California
A Mathematical Theory of Communication
Claude E. Shannon (1948) · Bell System Technical Journal · IEEE
A Symbolic Analysis of Relay and Switching Circuits
Claude Elwood Shannon (1940)
A Symbolic Analysis of Relay and Switching Circuits
Claude E. Shannon (1938) · Transactions of the American Institute of Electrical Engineers · American Institute of Electrical Engineers
Transmission of Information
R. V. L. Hartley (1928) · Bell System Technical Journal · IEEE
Certain Factors Affecting Telegraph Speed
H. Nyquist (1924) · Bell System Technical Journal · IEEE