Computer Science BooksPrograming Theory Books

Patterns for Adaptive Programming (AP)

Advertisement

Patterns for Adaptive Programming (AP)

Patterns for Adaptive Programming (AP)

Currently this section contains no detailed description for the page, will update this page soon.

Author(s):

s Pages
Similar Books
Lecture Notes on Programming Theory for Management Information Systems

Lecture Notes on Programming Theory for Management Information Systems

This note exlains the following toipics: Basic Business Data Analysis, Python as a Basic and Business Calculator, X Y Plots, Simple Data Analysis, Manipulating Data and More Complex Data Analysis, Reading In and Writing Out Text Data, Automating and Managing Information Systems, Managing Files, Managing Collections of Files Directories, Managing Collections of Files Searching and Designing Power Programs.

s140 Pages
Coding and Cryptography

Coding and Cryptography

Coding theory includes the study of compression codes which enable us to send messages cheaply and error correcting codes which ensure that messages remain legible even in the presence of errors. Topics covered includes: Codes and alphabets, Huffman’s algorithm, Shannon’s noiseless coding theorem , Hamming’s breakthrough, Shannon’s noisy coding theorem , Linear codes, Polynomials and fields , Cyclic codes, Stream ciphers, Asymmetric systems, Commutative public key systems, Trapdoors and signatures.

s104 Pages
Coding Theory and Applications

Coding Theory and Applications

This book has been written as lecture notes for students who need a grasp of the basic principles of linear codes. Topics covered includes: Shannon theory and coding, Coding theory, Decoding of linear codes and MacWilliams identity, Coding theory - Constructing New Codes, Coding theory - Bounds on Codes, Reed-Muller codes, Fast decoding of RM codes and higher order RM codes.

s154 Pages
Course Notes on Coding Theory

Course Notes on Coding Theory

This note covers the following topics: Basic codes and constructions, Algebraic Geometry Codes, Limits on Performance of Codes, Algebraic decoding, Algebraic decoding, Linear time decoding, Decoding from random errors and erasures, Applications in complexity theory and Complexity results in coding theory.

sNA Pages
Essential Coding Theory

Essential Coding Theory

This book explains the following topics: Linear Codes, Probability as Fancy Counting and the q-ary Entropy Function, Combinatorics, The Greatest Code of Them All: Reed-Solomon Codes, What Happens When the Noise is Stochastic: Shannon's Theorem, Bridging the Gap Between Shannon and Hamming: List Decoding, Code Constructions, Code Concatenation, Algorithms, Decoding Concatenated Codes, Efficiently Achieving the Capacity of the BSCp, Efficient Decoding of Reed-Solomon Codes, Efficiently Achieving List Decoding Capacity, Applications.

sNA Pages
Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs

This note covers the following topics: Functions, Values and Side Effects, Control and Higher-Order Functions, Environments and Lambda, Newton's Method and Recursion, Data Abstraction, Sequences and Iterables, Objects, Lists, and Dictionaries, Mutable Data Types, Object-Oriented Programming, Inheritance, Generic Functions, Coercion and Recursive Data, Functional Programming, Declarative Programming, Unification, MapReduce, Parallelism.

sNA Pages
Theory     in Programming Practice (PDF 250P)

Theory in Programming Practice (PDF 250P)

Covered topics are: Text Compression, Error Detection and Correction, Cryptography, Finite State Machines, Recursion and Induction, Relational Database, String Matching and Parallel Recursion.

s250 Pages
Algorithmic Introduction to Coding Theory

Algorithmic Introduction to Coding Theory

This note introduces the theory of error-correcting codes to computer scientists. This theory, dating back to the works of Shannon and Hamming from the late 40's, overflows with theorems, techniques, and notions of interest to theoretical computer scientists. The course will focus on results of asymptotic or algorithmic significance. Principal topics include: Construction and existence results for error-correcting codes, Limitations on the combinatorial performance of error-correcting codes, Decoding algorithms, Applications in computer science.

sNA Pages
Learning to Program (Alan Gauld)

Learning to Program (Alan Gauld)

Simple Sequences, The Raw Materials, Loops, Branching, Modules & Functions, Handling Files, Handling Text, Error Handling, Regular Expressions, Object Oriented Programming, Event Driven Programming, GUI Programming, Recursion, Python in Practice, Working with Databases, Using the Operating System, Inter-process communications and Network programming.

sNA Pages
Learn to Program A Tutorial for the Future Programmer (Chris Pine)

Learn to Program A Tutorial for the Future Programmer (Chris Pine)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages

Advertisement