Codes and Cryptography by Dominic Welsh
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
'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
Geoffrey Grimmett, Professor of Mathematical Statistics, University of Cambridge, Dominic Welsh, Professor of Mathematics (retired), University of Oxford Geoffrey Grimmett is Professor of Mathematical Statistics at the University of Cambridge and Master of Downing College, Cambridge. His reserach interests lie in disordered physical systems, including percolation and related processes. He has written numerous research articles in probability theory
and statistical mechanics, as well as three research books and two successful textbooks on probability and random processes at the undergraduate and postgraduate levels. Dominic Welsh held the John von Neumann Professorship at Bonn in 1990-91, and was appointed Professor of Mathematics at Oxford in 1993. His research interests include combinatorics and complexity theory, and he has written more than a hundred papers in these areas. He retired from Oxford University
in 2005, and has since then held visiting positions in New Zealand and Barcelona.
| SKU | Unavailable |
| ISBN 13 | 9780198532873 |
| ISBN 10 | 0198532873 |
| Title | Codes and Cryptography |
| Author | Dominic Welsh |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Oxford University Press |
| Year published | 1988-06-09 |
| Number of pages | 272 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |