Cantitate/Preț
Produs

Introduction to Information Theory and Data Compression: Applied Mathematics

Autor Jr. Johnson, Greg A. Harris, D.C. Hankerson
en Limba Engleză Paperback – 25 sep 2019
An effective blend of carefully explained theory and practical applications, this text imparts the fundamentals of both information theory and data compression. Although the two topics are related, this unique text allows either topic to be presented independently, and it was specifically designed so that the data compression section requires no prior knowledge of information theory.

The treatment of information theory, while theoretical and abstract, is quite elementary, making this text less daunting than many others. After presenting the fundamental definitions and results of the theory, the authors then apply the theory to memoryless, discrete channels with zeroth-order, one-state sources.

The chapters on data compression acquaint students with a myriad of lossless compression methods and then introduce two lossy compression methods. Students emerge from this study competent in a wide range of techniques. The authors' presentation is highly practical but includes some important proofs, either in the text or in the exercises, so instructors can, if they choose, place more emphasis on the mathematics.

Introduction to Information Theory and Data Compression, Second Edition is ideally suited for an upper-level or graduate course for students in mathematics, engineering, and computer science.

Features:

  • Expanded discussion of the historical and theoretical basis of information theory that builds a firm, intuitive grasp of the subject
  • Reorganization of theoretical results along with new exercises, ranging from the routine to the more difficult, that reinforce students' ability to apply the definitions and results in specific situations.
  • Simplified treatment of the algorithm(s) of Gallager and Knuth
  • Discussion of the information rate of a code and the trade-off between error correction and information rate
  • Treatment of probabilistic finite state source automata, including basic resul
  • Citește tot Restrânge

    Toate formatele și edițiile

    Toate formatele și edițiile Preț Express
    Paperback (1) 49307 lei  43-57 zile
      CRC Press – 25 sep 2019 49307 lei  43-57 zile
    Hardback (1) 105354 lei  43-57 zile
      CRC Press – 26 feb 2003 105354 lei  43-57 zile

    Din seria Applied Mathematics

    Preț: 49307 lei

    Preț vechi: 61634 lei
    -20% Nou

    Puncte Express: 740

    Preț estimativ în valută:
    9435 9876$ 7853£

    Carte tipărită la comandă

    Livrare economică 31 martie-14 aprilie

    Preluare comenzi: 021 569.72.76

    Specificații

    ISBN-13: 9780367395438
    ISBN-10: 0367395436
    Pagini: 384
    Dimensiuni: 156 x 234 x 23 mm
    Greutate: 0.45 kg
    Ediția:2nd edition
    Editura: CRC Press
    Colecția Chapman and Hall/CRC
    Seria Applied Mathematics


    Cuprins

    INFORMATION THEORY: Elementary Probability. Information and Entropy. Channels and Channel Capacity. Coding Theory. DATA COMPRESSION: Lossless Data Compression by Replacement Schemes. Arithmetic Coding. Higher-Order Modeling. Adaptive Methods. Dictionary Methods. Transform Methods and Image Compression. Appendices. Bibliography. Index.

    Notă biografică

    Johnson, Jr.; Harris, Greg A.; Hankerson, D.C.

    Descriere

    This book provides a basic introduction to both information theory and data compression. Although the two topics are related, this unique treatment allows readers to explore either topic independently. The authors' presentation of information theory is pitched at an elementary level, making the book less daunting than most other texts. The second edition includes a detailed history of information theory that provides a solid background for the quantification of the topic as developed by Claude Shannon. It also covers the information rate of a code and the trade-off between error correction and rate of information transmission, probabilistic finite state source automata, and wavelet methods.