Item #28677 Certain Results in Coding Theory for Noisy Channels [offprint]. Claude E. Shannon, Claude Elwood.
Certain Results in Coding Theory for Noisy Channels [offprint]
The offprint issue

Certain Results in Coding Theory for Noisy Channels [offprint]

[New York]: Academic Press September 1957. [5-blank ], 6-25, [1-blank] pages. Self-wrappers. 8 7/8 x 6 inches. Stapled at the spine. Staples rusty. Near Fine. Wraps. [28677]


"In this paper, we will develop certain extensions and refinements of coding theory for noisy communication channels. First, a refinement of the argument based on 'random' coding will be used to obtain an upper bound on the probability of error for an optimal code in the memoryless finite discrete channel. Next, an equation is obtained for the capacity of a finite state channel when the state can be calculated at both transmitting and receiving terminals. An analysis is also made of the more complex case where the state is calculable at the transmitting point but not necessarily at the receiving point" (abstract)

"Information and Control," Vol 1 pp. 6-25, September 1957 first published this paper. Here offered in the offprint form. The Bell System Monograph series (#2982: June 1958) later reprinted this paper.

PROVENANCE: The personal files of Claude E. Shannon (unmarked). There were eight examples of this item in Claude Shannon's files.

REFERENCES:
Sloane and Wyner, "Claude Elwood Shannon Collected Papers," #111
Hook and Norman, "Origins of Cyberspace," #895
Reprinted in D. Slepian, editor, "Key Papers in the Development of Information Theory," IEEE Press, NY, 1974, pp 124-129

ITEM SOLD

Create a want for this item, and we will notify you via e-mail if another copy becomes available.
See all items in Mathematics
See all items by ,