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)
Click to view full size.

Introduction To Information Theory and Data Compression (Second Edition) Hardback - 2003

by Hankerson, Darrel; Harris, Greg A.; Johnson, Peter D. Jr

Add to wish list
  • Used
  • near fine
  • Hardback
Used - Near Fine

Description

Boca Raton, FL: Chapman & Hall/CRC, 2003. Hardcover, [xi], 366 pages. Near Fine condition. Second edition. Size 9.5"x6.25". "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." Please see accompanying photos for contents. Book has light exterior shelfwear, else Fine condition, clean and unmarked.. Near Fine.
Ask the seller a question Add to wish list
A$46.33
A$7.96 Delivery within USA
Standard delivery: 5 to 14 days
More delivery options
Ships from Florida Mountain Book Co. (New Mexico, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Introduction To Information Theory and Data Compression (Second Edition)
  • Author Hankerson, Darrel; Harris, Greg A.; Johnson, Peter D. Jr
  • Binding Hardback
  • Edition International Ed
  • Condition Used - Near Fine
  • Pages 378
  • Volumes 1
  • Language ENG
  • Publisher Chapman & Hall/CRC, Boca Raton, FL
  • Publication date 2003
  • Illustrated Yes
  • Features Bibliography, Illustrated
  • Bookseller's Inventory # 009820
  • 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
  • Bookseller catalogues Internet Listing

About Florida Mountain Book Co. New Mexico, United States

Biblio member since 2004

The Florida Mountains are located in southwestern New Mexico, near the U.S.-Mexico border. The Parsons family, proprietors of Florida Mountain Book Company, have been in the book business since 1996. Formerly the owners & operators of Readers' Cove Bookstore in Deming, New Mexico, beginning in May of 2012, we are now exclusively based on the internet.

Terms of Sale:

For information or phone orders please call 575-694-5672. Shipping within USA via US Postal Service $5.50 (Standard) or $9.50 (Priority). Shipping outside of USA via Priority International Mail $42.95 ($32.95 Canada) for average-sized books. Other arrangements by request. Return policy: Please call within 3 days of receipt.

Browse books from Florida Mountain Book Co.

Reader reviews for Introduction To Information Theory and Data Compression (Second Edition)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

    Please wait a moment while we load the requested page.

    tracking-