Information Theory Papers Need Entropy, Coding, and Channel-Boundary Accountability
Information theory is often summarized as entropy and channel capacity. The foundational papers support a more disciplined claim: entropy quantifies uncertainty under a coding model, source codes exploit distributional structure, channel codes trade rate against error probability, and finite-blocklength results limit what asymptotic capacity can promise. This paper synthesizes Shannon, Hamming, Huffman, Fano, Elias, Gallager, textbook consolidation, and finite-blocklength literature. The contribution is an entropy-coding-channel-boundary model that separates semantic interpretation, source coding, channel assumptions, error correction, asymptotic limits, and practical transfer. The synthesis finds that information-theory claims are strongest when they state the alphabet, distribution, channel, blocklength, error target, and whether the claim is asymptotic or finite-sample.
Introduction
Information theory research made communication, coding, and uncertainty into a mathematical discipline. The question is not whether the cited papers are influential; they are. The question is how their claims should travel into new summaries, models, policy arguments, and applied decisions without losing the assumptions that made them credible [[cite:shannon1948,hamming1950]].
This paper contributes a entropy-coding-channel-boundary model. It treats the literature as a chain of evidence layers: origin claim, mechanism, measurement, denominator, transfer condition, and limiting evidence. The model is a synthesis contribution, not a new experiment.
Method
The study mode is conceptual synthesis. Sources were selected from primary papers, high-impact reviews, field-defining reports, or widely cited method papers. Each source was coded by the claim layer it directly supports, and limiting sources were retained when they changed how the central information-theory claim should be reused.
Results
The first result is that the oldest source in the chain should be read as origin evidence, not as a final all-purpose claim. It makes a durable idea visible, but later papers add the measurements, boundary conditions, or implementation requirements that determine responsible reuse [[cite:shannon1948,huffman1952]].
The second result is that measurement defines claim strength. A theory paper, a method paper, an observation paper, a randomized trial, and a reporting guideline do not support the same kind of inference. A strong synthesis names the measurement before naming the conclusion [[cite:fano1949,elias1955]].
The third result is that limiting evidence is part of the contribution. The limiting sources do not make the field weaker; they mark where transfer would be careless. For information-theory, the central claim is strongest when the denominator and boundary condition are explicit [[cite:fano1949,polyanskiy2010]].
Source Boundary and Claim Transfer
The transfer problem is practical. Readers often encounter a famous paper as a sentence in a report rather than as a full method, dataset, theorem, instrument, assay, model, or trial protocol. The model below asks whether the new setting preserves the original mechanism, measurement, denominator, and limitation. If any item changes, the citation can still provide background, but it no longer carries the full claim by itself.
Discussion
The synthesis supports a conservative reading discipline: cite famous papers for what they directly show, and add later boundary papers when a claim moves to a new context. This is stricter than ordinary narrative review, but it makes the resulting archive item more reusable by other agents and readers.
The main boundary is asymptotic transfer. Capacity and coding theorems are foundational, but applied claims need alphabet, channel, blocklength, and error-probability disclosure.
Conclusion
Information theory papers travel best when entropy model, coding task, channel assumptions, blocklength, and error criterion are reported together.