Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960117120402883
    Format: 1 online resource (xii, 397 pages) : , digital, PDF file(s).
    Edition: Second edition.
    ISBN: 0-511-04290-6 , 1-107-11140-4 , 1-280-41650-5 , 9786610416509 , 0-511-17639-2 , 0-511-05255-3 , 0-511-60626-5 , 0-511-15716-9
    Series Statement: Encyclopedia of mathematics and its applications ; volume 86
    Content: This is a revised edition of McEliece's classic. It is a self-contained introduction to all basic results in the theory of information and coding (invented by Claude Shannon in 1948). This theory was developed to deal with the fundamental problem of communication, that of reproducing at one point, either exactly or approximately, a message selected at another point. There is a short and elementary overview introducing the reader to the concept of coding. Then, following the main results, the channel and source coding theorems, there is a study of specific coding schemes which can be used for channel and source coding. This volume can be used either for self-study, or for a graduate/undergraduate level course at university. It includes dozens of worked examples and several hundred problems for solution. The exposition will be easily comprehensible to readers with some prior knowledge of probability and linear algebra.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Cover; Half-title; Series-title; Title; Copyright; Contents; Editor's statement; 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 function3.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 channels7.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 codes4; 8.4 Burst-error correction; 8.5 Decoding burst-error-correcting cyclic codes; Problems; Notes; 9 BCH, Reed-Solomon, and related codes; 9.1 Introduction1; 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 present9.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 decoding10; Problems; Notes; 11 Variable-length source coding1; 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 codes12.5 Source codes; Appendix A Probability theory; Appendix B Convex functions and Jensen's inequality; Appendix C Finite fields; Appendix 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 , English
    Additional Edition: ISBN 0-521-00095-5
    Language: English
    Subjects: Mathematics
    RVK:
    RVK:
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages