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 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 note
covers the following topics: Introduction to programming, Use of objects and
variables, Definition of methods and classes, Primitive data types, Conditional
statements, Loop statements, Arrays and matrices, Files and input/output
streams, Program errors and exception handling, Recursion, Dynamic arrays and
linked lists.
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 note explains
the following topics: Object-oriented programming, Data encapsulation with
classes, Subclasses and inheritance, Abstract classes, Exception handling,
Reflection, Concurrent programming, Functional programming, Logic programming,
Scripting languages.
Covered topics
are: Text Compression, Error Detection and Correction, Cryptography, Finite
State Machines, Recursion and Induction, Relational Database, String
Matching and Parallel Recursion.
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.
This book covers the following
topics: Introduction to Programming,
General Computation Models, Declarative Programming Techniques, Declarative
Concurrency, Relational Programming, Object-Oriented Programming, Encapsulated
State, Concurrency and State, Specialized Computation Models, Semantics and
Virtual Machines.