cryptography Free ebook download

Springer | ISBN: 0387212450 | April 12, 2005 | 552 pages | PDF | 35 MB Coding is an highly integral component of viable and efficient computer and data communications, yet the often heavy mathematics that form the basis of coding can prevent a serious and practical understanding of this important area. "Coding for Data and Computer Communications" eschews the complex mathematics and clearly describes the core concepts, principles, and methods of channel codes ( for error correction), source codes (for compressing data), and secure codes (for cryptography, data hiding, and privacy). ... Ebook description

Springer | ISBN: 0387282882 | 2005-11-17 | PDF (OCR) | 277 pages | 16.46 Mb Neural networks are members of a class of software that have the potential to enable intelligent computational systems capable of simulating characteristics of biological thinking and learning. Currently no standards exist to verify and validate neural network-based systems. ... Ebook description

Springer | 2008 | ISBN: 3540744517 | 274 pages | PDF | 1,7 MB "Bist du nicht willig, so brauch` ich Gewalt" -- ein Grundsatz, der mit moderner PC-Leistungsfähigkeit auch für einige Verschlüsselungsmethoden gilt. Im Zuge der immer weiter gehenden Vernetzung von Unternehmen, Haushalten und Privatpersonen wird ein gesicherter Datentransfer immer wichtiger. ... Ebook description

Oxford University Press, USA | ISBN: 0030720443 | 1984-12-31 | djvu (ocr) | 560 pages | 5.00 Mb The purpose of this book is to teach the tequniques needed to analyze algorithms. Students should have a background in computer science up through data structures and in mathematics through calculus. The text is organized by analysis techniques and includes a systematic and largely self-contained treatment of the mathematics needed for elementary and intermediate analysis, as well as brief guides to the sources for more advanced techniques. ... Ebook description

John Wiley and Sons Inc | ISBN: 0471903221 | 1985-01 | djvu (ocr) | 233 pages | 1.92 Mb 'Analysis of algorithms' is quite important in computer programming, because there are generally several algorithms available for a particular application and we would like to measure and compare the time and storage requirements. Time may be measured by counting steps, statements, or the number of times some given operation is performed; space may be measured by bits, words, or the number of registers and cells required during execution of the algorithm. ... Ebook description

John Wiley & Sons | ISBN: 047153272X | 1991-04 | djvu (ocr) | 192 pages | 1.66 Mb This volume examines two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling (in which a set of objects has to be ordered subject to a number of conditions), and packing and partitioning (in which a set of objects has to be split into subsets in order to meet a certain objective). ... Ebook description

Springer | ISBN: 3540556516 | 1992-09-10 | djvu (ocr) | 223 pages | 1.75 Mb About ten years ago, V.D. Goppa found a surprising connection between the theory of algebraic curves over a finite field and error-correcting codes. The aim of the meeting "Algebraic Geometry and Coding Theory" was to give a survey on the present state of research in this field and related topics. ... Ebook description