A Mathematical Theory of Communication
This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.
By C. E. SHANNON
Một lý thuyết toán học về truyền thông
Bởi C. E. SHANNON
Sự phát triển gần đây của nhiều phương pháp điều chế khác nhau như PCM và PPM, trong đó trao đổi băng thông lấy tỷ số tín hiệu trên nhiễu, đã làm tăng sự quan tâm đến một lý thuyết tổng quát về truyền thông. Cơ sở cho một lý thuyết như vậy được chứa trong các bài báo quan trọng của Nyquist¹ và Hartley² về chủ đề này. Trong bài báo hiện tại, chúng tôi sẽ mở rộng lý thuyết để bao gồm một số yếu tố mới, đặc biệt là ảnh hưởng của nhiễu trong kênh, và những sự tiết kiệm có thể có nhờ cấu trúc thống kê của thông điệp ban đầu và nhờ bản chất của đích đến cuối cùng của thông tin.
Introduction
This section is missing here.
1 THE DISCRETE NOISELESS CHANNEL
This section is missing here.
2 THE DISCRETE SOURCE OF INFORMATION
This section is missing here.
3 THE SERIES OF APPROXIMATIONS TO ENGLISH
This section is missing here.
4 Third-order approximation (trigram structure as in English)
This section is missing here.
5 Ergodic and Mixed Sources
This section is missing here.
6 Choice, Uncertainty and Entropy
This section is missing here.
7 THE ENTROPY OF AN INFORMATION SOURCE
This section is missing here.
8 REPRESENTATION OF THE ENCODING AND DECODING OPERATIONS
This section is missing here.
9 THE FUNDAMENTAL THEOREM FOR A NOISELESS CHANNEL
This section is missing here.
10 DISCUSSION AND EXAMPLES
This section is missing here.
11 REPRESENTATION OF A NOISY DISCRETE CHANNEL
This section is missing here.
12 EQUIVOCATION AND CHANNEL CAPACITY
This section is missing here.
13 The Fundamental Theorem for a Discrete Channel with Noise
This section is missing here.
14 DISCUSSION
This section is missing here.
15 EXAMPLE OF A DISCRETE CHANNEL AND ITS CAPACITY
This section is missing here.
16 THE CHANNEL CAPACITY IN CERTAIN SPECIAL CASES
This section is missing here.
17 AN EXAMPLE OF EFFICIENT CODING
This section is missing here.
Appendix 1
This section is missing here.
Appendix 2
This section is missing here.
Appendix 3
This section is missing here.
Appendix 4
This section is missing here.
18 SETS AND ENSEMBLES OF FUNCTIONS
This section is missing here.
19 Band Limited Ensembles of Functions
This section is missing here.
20 Entropy of a Continuous Distribution
This section is missing here.
21 Entropy of an Ensemble of Functions
This section is missing here.
22 Entropy Loss in Linear Filters
This section is missing here.
23 ENTROPY OF A SUM OF TWO ENSEMBLES
This section is missing here.
24 THE CAPACITY OF A CONTINUOUS CHANNEL
This section is missing here.
25 Channel Capacity with an Average Power Limitation
This section is missing here.
26 THE CHANNEL CAPACITY WITH A PEAK POWER LIMITATION
This section is missing here.
27 FIDELITY EVALUATION FUNCTIONS
This section is missing here.
28 THE RATE FOR A SOURCE RELATIVE TO A FIDELITY EVALUATION
This section is missing here.
29 THE CALCULATION OF RATES
This section is missing here.
Acknowledgments
This section is missing here.
Appendix 5
This section is missing here.
Appendix 6
This section is missing here.
Appendix 7
This section is missing here.
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8.
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8. Translated into Tiếng Việt by gpt-5, against glossary version 7. Translated from the English.