信息论与编码理论(第2版) 英文版 (2010 年度畅销榜NO.7114 )

本书主要介绍由香农理论发展起来的信息论与编码理论，用于解决通信中的基本问题。首先简要介绍编码的概念；第一部分介绍香农理论、信道与信源编码理论；第二部分详细介绍几种编码方案，可用于信道与信源编码。书中提供了大量实例，每章末均有习题与说明，以便于具有概率论与线性代数知识的读者掌握和理解。\r\n 本书可用做信息、通信、电子工程等专业的相关课教材，也可作为有一定英语基础的人员自学使用。

Section editor''s foreword\r\nPreface to the first edition\r\nPreface to the second edition\r\nIntroduction\r\n　Problems\r\n　Notes\r\nPart one: Information theory\r\n　1 Entropy and mutual information\r\n　　1.1 Discrete random variables\r\n　　1.2 Discrete random vectors\r\n　　1.3 Nondiscrete random variables and vectors\r\n　　Problems\r\n　　Notes\r\n　2 Discrete memoryless channels and their capacity-cost functions\r\n　　2.1 The capacity-cost function\r\n　　2.2 The channel coding theorem\r\n　　Problems\r\n　　Notes\r\n　3 Discrete memoryless sources and their rate-distortion functions\r\n　　3.1 The rate-distortion function\r\n　　3.2 The source coding theorem\r\n　　Problems\r\n　　Notes\r\n　4 The Gaussian channel and source\r\n　　4.1 The Gaussian channel\r\n　　4.2 The Gaussian source\r\n　　Problems\r\n　　Notes\r\n　5 The source-channel coding theorem\r\n　　Problems\r\n　　Notes\r\n　6 Survey of advanced topics for part one\r\n　　6.1 Introduction\r\n　　6.2 The channel coding theorem\r\n　　6.3 The source coding theorem\r\nPart two:Coding theory\r\n　7 Linear codes\r\n　　7.1 Introduction:The generator and parity-check matrices\r\n　　7.2 Syndrome decoding on q-ary symmetric channels\r\n　　7.3 Hamming geometry and code performance\r\n　　7.4 Hamming codes\r\n　　7.5 Syndrome decoding on general q-ary channels\r\n　　7.6 Weight enumerators and the MacWilliams identities\r\n　　Problems\r\n　　Notes\r\n　8 Cyclic codes\r\n　　8.1 Introduction\r\n　　8.2 Shift-register encoders for cyclic codes\r\n　　8.3 Cyclic Hamming codes\r\n　　8.4 Burst-error correction\r\n　　8.5 Decoding burst-error correcting cyclic code\r\n　　Problems\r\n　　Notes\r\n　9 BCH,Reed-solomon,and related codes\r\n　　9.1 Introduction\r\n　　9.2 BCH codes as cyclic codes\r\n　　9.3 Decoding BCH codes,Part one:the key equation\r\n　　9.4 Euclid''s algorithm for polynomials\r\n　　9.5 Decoding BCH codes,Part two:the algorithms\r\n　　9.6 Reed-Solomon codes\r\n　　9.7 Decoding when erasures are present\r\n　　9.8 The(23,12)Golay code\r\n　　Problems\r\n　　Notes\r\n　10 Convolutional codes\r\n　　10.1 Introduction\r\n　　10.2 State diagrams,trellises,and Viterbi decoding\r\n　　10.3 Path enumerators and error bounds\r\n　　10.4 Sequential decoding\r\n　　Problems\r\n　　Notes\r\n　11 Variable-length source coding\r\n　　11.1 Introduction\r\n　　11.2 Uniquely decodable variable-length codes\r\n　　11.3 Matching codes to sources\r\n　　11.4 The construction of optimal UD codes(Huffman''s algorithm)\r\n　　Problems\r\n　　Notes\r\n　12 Survey of advanced topics for Part two\r\n　　12.1 Introduction\r\n　　12.2 Block codes\r\n　　12.3 Convolutional codes\r\n　　12.4 A comparison of block and convolutional codes\r\n　　12.5 Source codes\r\nAppendices\r\n　A Probability theory\r\n　B Convex functions and Jensen''s inequality\r\n　C Finite fields\r\n　D Path enumeration in directed graphs\r\nReferences\r\n　1 General reference textbooks\r\n　2 An annotated bibliography of the theory of information and coding\r\n　3 Original papers cited in the text\r\nIndex of Theorems\r\nIndex

Preface to the first edition

This book is meant to be a self-contained introduction to the basic results in the theory of information and coding. It was written during 1972-1976, when I taught this subject at Caltech. About half my students were electrical ngineering graduate students; the others were majoring in all sorts of other fields (mathematics, physics, biology, even one English major!). As a result the course was aimed at nonspecialists as well as specialists, and so is this book.

The book is in three parts: Introduction, Part one (Information Theory), and Part two (Coding Theory). It is essential to read the introduction first, because it gives an overview of the whole subject. In Part one, Chapter 1 is fundamental, but it is probably a mistake to read it first, since it is really just a collection of technical results about entropy, mutual information, and so forth. It is better regarded as a reference section, and should be consulted as necessary to understand Chapters 2-5. Chapter 6 is a survey of advanced results, and can be read independently. In Part two, Chapter 7 is basic and must be read before Chapters 8 and 9; but Chapter 10 is almost, and Chapter 11 is completely, independent from Chapter 7. Chapter 12 is another survey chapter independent of everything else.

The problems at the end of the chapters are very important. They contain verification of many omitted details, as well as many important results not mentioned in the text. It is a good idea to at least read the problems. There are four appendices. Appendix A gives a brief survey of probability theory, essential for Part one. Appendix B discusses convex functions and Jensen's inequality. Appeals to Jensen's inequality are frequent in Part one, and the reader unfamiliar with it should read Appendix B at the first opportunity. Appendix C sketches the main results about finite fields needed in Chapter 9. Appendix D describes an algorithm for counting paths in directed graphs which is needed in Chapter 10.

A word about cross-references is in order: sections, figures, examples, theorems, equations, and problems are numbered consecutively by chapters, using double numeration. ' Thus "Section 2.3," "Theorem 3.4," and "Prob. 4.17" refer to section 3 of Chapter 2, Theorem 4 of Chapter 3, and Problem 17 of Chapter 4, respectively. The appendices are referred to by letter; thus "Equation (B.4)" refers to the fourth numbered equation in Appendix B.

The following special symbols perhaps need explanation: "□" signals the end of a proof or example; "iff" means if and only if, [x] denotes the largest integer ≤ x; and [x] denotes the smallest integer ≥ x.

Finally, I am happy to acknowledge my debts: To Gus Solomon, for introducing me to the subject in the first place; to John Pierce, for giving me the oppommity to teach at Caltech; to Gian-Carlo Rom, for encouraging me to write this book; to Len Baumert, Stan Butman, Gene Rodemich, and Howard Rumsey, for letting me pick their brains; to Jim Lesh arid Jerry Heller, for supplying data for Figures 6.7 and 12.2; to Bob Hall, for drafting the figures; to my typists, Ruth Stratton, Lillian Johnson, and especially Dian Rapchak; and to Ruth Flohn for copy editing.

ROBERT J. McELIECE

Preface to the second edition

The main changes in this edition are in Part two. The old Chapter 8 ("BCH, Goppa, and Related Codes") has been revised and expanded into two new chapters, numbered 8 and 9. The old chapters 9, 10, and 11 have then been renumbered 10, 11, and 12. The new Chapter 8 ("Cyclic codes") presents a fairly complete treatment of the mathematical theory of cyclic codes, and their implementation with shift register circuits. It culminates with a discussion of the use of cyclic codes in burst error correction. The new Chapter 9 ("BCH, Reed-Solomon, and Related Codes") is much like the old Chapter 8, except that increased emphasis has been placed on Reed-Solomon codes, reflecting their importance in practice. Both of the new chapters feature dozens of new problems.