This book covers the following topics: Computer Architecture,
Functions, Files, Reading and Writing Simple Records, Developing Robust
Programs, Sharing Functions with Code Libraries, Intermediate Memory Topics,
High-Level Languages and Optimization.
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,
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
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.