Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Diacritical analysis of systems
Oswald J., Ellis Horwood, Upper Saddle River, NJ, 1991. Type: Book (9780132087520)
Date Reviewed: Aug 1 1992

The original French edition of this work was published in 1986. The title is unusual for a book on information theory, and its cryptic quality is symptomatic of the problems that will make the contents obscure for most readers. Oswald believes that many roadblocks to our understanding of information theory have been brought on by the linguistic imprecision that he feels has burdened the subject over its 40-year history. To rectify this problem, he has changed the names of most of the well-known standard items: entropy becomes diacritical density, information bits become Shannons (in natural units, they are logons), and raw channel errors become faults, to cite a few. This attempt at precision generally backfires, and forces the reader to make frequent visits to the glossary to translate this unconventional language.

Many important topics are not covered in this book. These include the Bhahut-Arimoto algorithm to find channel capacity, the Lempel-Ziv algorithm for source coding, and the asymptotic equipartition property, which is one of the true foundation stones of information theory. Although the book is intended for engineers, little here will be of use to the practitioner. The section on convolutional codes, for example, is misleading and hides the advantages that convolutional codes have over block codes.

The main publishing event in information theory in 1991 was the appearance of the book by Cover and Thomas [1], which treats the subject with greater depth, breadth, and clarity than Oswald’s book. That is the book that I would recommend for serious students of this subject at any level.

Reviewer:  Paul J. Crepeau Review #: CR116061
1) Cover, T. M. and Thomas, J. A. Elements of information theory. Wiley, New York, 1991.
Bookmark and Share
 
Coding And Information Theory (E.4 )
 
 
Information Theory (H.1.1 ... )
 
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
 
Optimization (G.1.6 )
 
Would you recommend this review?
yes
no
Other reviews under "Coding And Information Theory": Date
Bruck nets, codes, and characters of loops
Moorhouse G. Designs, Codes and Cryptography 1(1): 7-29, 1991. Type: Article
Jul 1 1992
A simple proof of the Delsarte inequalities
Simonis J., de Vroedt C. Designs, Codes and Cryptography 1(1): 77-82, 1991. Type: Article
Dec 1 1991
Coding and information theory
Roman S., Springer-Verlag New York, Inc., New York, NY, 1992. Type: Book (9780387978123)
Oct 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy