BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Introduction to Information Theory and Data Compression, Second Edition

Introduction to Information Theory and Data Compression, Second Edition

Introduction to Information Theory and Data Compression, Second Edition
Stock photo: cover may vary

Introduction to Information Theory and Data Compression, Second Edition Hardback - 2003

by Rosen, Kenneth H. (Series edited by)/ Hankerson, D.C. (Author)/ Harris, Greg A. (Author)/ Johnson, Jr., Peter D. (Author)

Add to wish list
  • New
  • Hardback
New

Description

Chapman & Hall, 2003. Hardcover. New. 2nd sub edition. 366 pages. 9.25x6.25x1.00 inches.
Ask the seller a question Add to wish list
A$450.61
A$29.28 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

  • Title Introduction to Information Theory and Data Compression, Second Edition
  • Author Rosen, Kenneth H. (Series edited by)/ Hankerson, D.C. (Author)/ Harris, Greg A. (Author)/ Johnson, Jr., Peter D. (Author)
  • Binding Hardback
  • Edition International Ed
  • Condition New
  • Pages 378
  • Volumes 1
  • Language ENG
  • Publisher Chapman & Hall, New Delhi
  • Publication date 2003
  • Illustrated Yes
  • Features Bibliography, Illustrated
  • Bookseller's Inventory # x-1584883138
  • ISBN 9781584883135 / 1584883138
  • Weight 1.5 lbs (0.68 kg)
  • Dimensions 9.74 x 6.08 x 0.9 in (24.74 x 15.44 x 2.29 cm)
  • Category Computers - General Information
  • Library of Congress subjects Information theory, Data compression (Computer science)
  • Library of Congress Catalogue Number 2002041506
  • Dewey Decimal Code 005.746
  • Quantity available 2

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for Introduction to Information Theory and Data Compression, Second Edition

From the publisher

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
  • First line

    A finite probability space is a pair (S, P), in which S is a finite non-empty set and P : S [0,1] is a function satisfying.

    About the author

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