This fundamental monograph introduces both the probabilistic and algebraic aspects of information theory and coding. It has evolved from the authors' years of experience teaching at the undergraduate level, including several Cambridge Maths Tripos courses. The book provides relevant background material, a wide range of worked examples and clear solutions to problems from real exam papers. It is a valuable teaching aid for undergraduate and graduate students, or for researchers and engineer...

Probability and statistics are as much about intuition and problem solving as they are about theorem proving. Consequently, students can find it very difficult to make a successful transition from lectures to examinations to practice because the problems involved can vary so much in nature. Since the subject is critical in so many applications from insurance to telecommunications to bioinformatics, the authors have collected more than 200 worked examples and examination questions with comp...

Tough Test Questions? Missed Lectures? Not Rnough Time?Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test ...

MULTIPLY your chances of understanding DISCRETE MATHEMATICSIf you're interested in learning the fundamentals of discrete mathematics but can't seem to get your brain to function, then here's your solution. Add this easy-to-follow guide to the equation and calculate how quickly you learn the essential concepts.Written by award-winning math professor Steven Krantz, Discrete Mathematics Demystified explains this challenging topic in an effective and e...

Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field.Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer scienc...

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a bro...

Our intention in writing this book is to give an elementary introduction to number theory which does not demand a great deal of mathematical back ground or maturity from the reader, and which can be read and understood with no extra assistance. Our first three chapters are based almost entirely on A-level mathematics, while the next five require little else beyond some el ementary group theory. It is only in the last three chapters, where we treat more advanced topics, including recent dev...

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.–Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.–Charles LongIf you think y...

Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes...

Today's pervasive computing and communications networks have created an intense need for secure and reliable cryptographic systems. Bringing together a fascinating mixture of topics in engineering, mathematics, computer science, and informatics, this book presents the timeless mathematical theory underpinning cryptosystems both old and new. Major branches of classical and modern cryptography are discussed in detail, from basic block and stream cyphers through to systems based on elliptic a...

This comprehensive and engaging textbook introduces the basic principles and techniques of signal processing, from the fundamental ideas of signals and systems theory to real-world applications. Students are introduced to the powerful foundations of modern signal processing, including the basic geometry of Hilbert space, the mathematics of Fourier transforms, and essentials of sampling, interpolation, approximation and compression The authors discuss real-world issues and hurdles to using ...

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a gl...