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 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.
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.
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 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 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: Basic Theories, Basic Data
Structures, Function Theory, Program Theory, Programming Language, Recursive
Definition, Theory Design and Implementation, Concurrency and Interaction.