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