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
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 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.
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.
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 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 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.
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.