This textbook unifies the concepts of information, codes and cryptography as first considered by Shannon in his seminal papers on communication and secrecy systems. The book has been the basis of a very popular course in Communication Theory which the author has given over several years to undergraduate mathematicians and computer scientists at Oxford. The first five chapters of the book cover the fundamental ideas of information theory,
compact encoding of messages, and an introduction to the theory of error-correcting codes. After a discussion of mathematical models of English, there is an introduction to the classical Shannon model of
cryptography. This is followed by a brief survey of those aspects of computational complexity needed for an understanding of modern cryptography, password systems and authentication techniques. Because the aim of the text is to make this exciting branch of modern applied mathematics available to readers with a wide variety of interests and backgrounds, the mathematical prerequisites have been kept to an absolute minimum. In addition to an extensive bibliography there
are many exercises (easy) and problems together with solutions.
' This excellent book can be strongly recommended... it is so well written that it could be read solely for interest and enjoyment.' Times Higher Educ. Supplement
'This authoritative book has a well structured approach. ...essential reading for the engineer concerned with safe-guarding as well as communicating information.' IEE Review
' an exciting introduction to codes and cryptography,but also manages to provide clear introductory accounts to a number of vitally important and closely related mathematical topics the most significant of which is computational complexity...It is surprising that a book can contain such a high rate of information per page and still be readable...This excellent book can be strongly recommended to anyone with the appropriate mathematical
background.'Times Higher Education Supplement
Entropy=Uncertainty=Information; The noiseless coding theorem for memoryless sources; Communication through noisy channels; Error-correcting codes; General sources; The structure of natural languages; Cryptosystems; The one-time pad and linear shift-register sequences; Computational complexity; One-way functions; Public key cryptosystems; Authentication and digital signatures; Randomized encryption; Appendices; Answers to exercises; Answers and hints to
problems; References; Index.