没有合适的资源?快使用搜索试试~ 我知道了~
首页Introduction to information theory and data compression(Second Edition)
Introduction to information theory and data compression(Second E...

Introduction to information theory and data compression Second Edition 信息论与数据压缩,经典书籍 Darrel Hankerson Greg A. Harris Peter D. Johnson, Jr.
资源详情
资源评论
资源推荐

Information
Theory
and
Data
Compression
Introduction to
Second Edition
© 2003 by CRC Press LLC

Abstract Algebra Applications with Maple,
Richard E. Klima, Ernest Stitzinger, and Neil P. Sigmon
Algebraic Number Theory,
Richard A. Mollin
An Atlas of the Smaller Maps in Orientable and Nonorientable Surfaces,
David M. Jackson and Terry I. Visentin
An Introduction to Crytography,
Richard A. Mollin
Combinatorial Algorithms: Generation Enumeration and Search,
Donald L. Kreher and Douglas R. Stinson
The CRC Handbook of Combinatorial Designs,
Charles J. Colbourn and Jeffrey H. Dinitz
Cryptography: Theory and Practice, Second Edition,
Douglas R. Stinson
Design Theory,
Charles C. Lindner and Christopher A. Rodgers
Frames and Resolvable Designs: Uses, Constructions, and Existence,
Steven Furino, Ying Miao, and Jianxing Yin
Fundamental Number Theory with Applications,
Richard A. Mollin
Graph Theory and Its Applications,
Jonathan Gross and Jay Yellen
Handbook of Applied Cryptography,
Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone
Handbook of Constrained Optimization,
Herbert B. Shulman and Venkat Venkateswaran
Handbook of Discrete and Combinatorial Mathematics,
Kenneth H. Rosen
Handbook of Discrete and Computational Geometry,
Jacob E. Goodman and Joseph O’Rourke
Introduction to Information Theory and Data Compression,
Darrel R. Hankerson, Greg A. Harris, and Peter D. Johnson
Network Reliability: Experiments with a Symbolic Algebra Environment,
Daryl D. Harms, Miroslav Kraetzl, Charles J. Colbourn, and John S. Devitt
RSA and Public-Key Cryptography
Richard A. Mollin
Quadratics,
Richard A. Mollin
Verification of Computer Codes in Computational Science and Engineering,
Patrick Knupp and Kambiz Salari
Series Editor
Kenneth H. Rosen, Ph.D.
AT&T Laboratories, Middletown, New Jersey
and
DISCRETE
MATHEMATICS
ITS APPLICATIONS
© 2003 by CRC Press LLC

CHAPMAN & HALL/CRC
A CRC Press Company
Boca Raton London New York Washington, D.C.
Darrel Hankerson
Greg A. Harris
Peter D. Johnson, Jr.
Information
Theory
and
Data
Compression
Introduction to
Second Edition
© 2003 by CRC Press LLC

This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with
permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish
reliable data and information, but the author and the publisher cannot assume responsibility for the validity of all materials
or for the consequences of their use.
Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical,
including photocopying, microfilming, and recording, or by any information storage or retrieval system, without prior
permission in writing from the publisher.
The consent of CRC Press LLC does not extend to copying for general distribution, for promotion, for creating new works,
or for resale. Specific permission must be obtained in writing from CRC Press LLC for such copying.
Direct all inquiries to CRC Press LLC, 2000 N.W. Corporate Blvd., Boca Raton, Florida 33431.
Trademark Notice:
Product or corporate names may be trademarks or registered trademarks, and are used only for
identification and explanation, without intent to infringe.
Visit the CRC Press Web site at www.crcpress.com
© 2003 by CRC Press LLC
No claim to original U.S. Government works
International Standard Book Number 1-58488-313-8
Library of Congress Card Number 2002041506
Printed in the United States of America 1 2 3 4 5 6 7 8 9 0
Printed on acid-free paper
Library of Congress Cataloging-in-Publication Data
Hankerson, Darrel R.
Introduction to information theory and data compression / Darrel R. Hankerson, Greg A.
Harris, Peter D. Johnson.--2nd ed.
p. cm. (Discrete mathematics and its applications)
Includes bibliographical references and index.
ISBN 1-58488-313-8 (alk. paper)
1. Information theory. 2. Data compression (Computer science) I. Harris, Greg A. II.
Johnson, Peter D. (Peter Dexter), 1945- III. Title. IV. Series.
Q360.H35 2003
005.74
¢6
—dc21 2002041506
CIP
C3138-discl. Page 1 Friday, January 17, 2003 1:19 PM
© 2003 by CRC Press LLC

Preface
This textbook is aimed at graduate students and upper level undergraduates
in mathematics, engineering, and computer science. The material and the ap-
proach of the text were developed over several years at Auburn University in two
independent courses, Information Theory and Data Compression. Although the
material in the two courses is related, we think it unwise for information theory
to be a prerequisite for data compression, and have written the data compression
section of the text so that it can be read by or presentedtostudents with no prior
knowledge of information theory. There are references in the data compression
part to results and proofs in the information theory part of the text, and those
who are interested may browse over those references, but it is not absolu tely
necessary to do so. In fact, perhaps the best pedagogical order of approach to
these subjects is the reverseoftheapparent logical order: students will come
to information theory curious an d bette rprepared for having seen some of the
definitions and theorems of that subject playing a role in data compression.
Our main aim in the data compression part of the text, as well as in the
course it grew from, is to acquaint the students with a number of significant
lossless compression techniques, and to discuss two lossy compression meth-
ods. Our aim is for the students to emerge competent in and broadly conversant
with a large range of techniques. We have striven for a “practical” style of
presentation: here is what you do and here is what it is good for. Nonethe-
less, proofs are provided, sometimes in the text, sometimes in the exercises, so
that the instructor can have the option of emphasizing the mathematics of data
compression to some degree.
Information theory is of a more theoretical nature than data compression.
It provides a vocabulary and a certain abstraction that can bring the power of
simplification to many different situations. We thought it reasonable to treat it
as a mathematical theory and to present the fundamental definitions and ele-
mentary results of that theory in utter abstraction from the particular problems
of communication through noisy channels, which inspired the theory in the first
place. We bring the theory to bear on noisy channels in Chapters 3 and 4.
The treatment of information theory given here is extremely elementary.
The channels are memoryless and discrete, and the sources are all “zeroth-
order,” one-state sources (although more complicated source models are dis-
cussed in Chapter 7). We feel that this elementary approach is appropriate for
the target audience, and that, by leavingmorecomplicated sources and channels
out of the picture, we more effectively impart the grasp of Information Theory
that we hope our students will take with them.
The exercises range from the routine to somewhat lengthy problems that
introduce additional material or establish more difficult results. An asterisk by
v
© 2003 by CRC Press LLC
剩余361页未读,继续阅读















安全验证
文档复制为VIP权益,开通VIP直接复制

评论1