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.
This PDF Programming Fundamentals covers the following topics
related to Programing Theory : Introduction to Programming Systems, Data and
Operators, Functions, Conditions, Loops, Arrays, Strings and Files,
Object-Oriented Programming.
Author(s): Kenneth Leroy Busbee, Dave
Braunschweig
This note explains the
following topics: Text Compression, Error Detection and Correction,
Cryptography, Finite State Machines, Recursion and Induction, Relational
Database.
This note covers the following
topics: Sphere Packing and Shannon’s Theorem, Linear Codes, Hamming Codes,
Generalized Reed-Solomon Codes, Modifying Codes, Codes over Subfields, Cyclic
Codes, Weight and Distance Enumeration.
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.
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.
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.
Author(s): Venkatesan Guruswami, Atri Rudra and Madhu
Sudan
This book provides a practitioner's guide for students, programmers,
engineers, and scientists who wish to design and build efficient and
cost-effective programs for parallel and distributed computer systems. It covers
the following topics: Parallel Computers and Computation, Designing Parallel
Algorithms, Quantitative Basis for Design, Putting Components Together, Tools,
Fortran M, High Performance Fortran, Message Passing Interface and Performance
Tools.