Programing Theory Books

# Algorithmic Introduction to Coding Theory

## Algorithmic Introduction to Coding Theory

Algorithmic Introduction to Coding Theory

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.

Author(s):

NA Pages

##### Similar Books

Notes on coding theory

This note covers the following topics: The naive way of coding, Coding schemes for binary channels and Shannon theorem, Shannon theorem, Exponential growth rate, Binary codes, The Hamming bound and perfect codes, The Gilbert-Varshamov bound, Error probability estimations, Union bound for BER, State representations and trellises of general codes, Convolutional codes, Tanner graphs and factor graphs.

NA Pages

Programming Languages Theory and Practice

This note covers the following topics: Inductive Definitions, Transition Systems, Defining a Language, Concrete Syntax, Abstract Syntax Trees, Abstract Binding Trees, Functional Language, Control and Data Flow, Imperative Functional Programming, Cost Semantics and Parallelism, Data Structures and Abstraction, Lazy Evaluation, Dynamic Typing, Subtyping and Inheritance, Concurrency.

277 Pages

Coding Theory and Applications

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.

154 Pages

Algorithmic Introduction to Coding Theory

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.

NA Pages

How To Design Programs An Introduction To Programming and Computing (M. Felleisen, et al)

The main focus of this book is the design process that leads from problem statements to well-organized solutions; it deemphasizes the study of programming language details, algorithmic minutiae, and specific application domains. It covers the following topics: Processing Simple Forms of Data, Processing Arbitrarily Large Data, Abstracting Designs, Generative Recursion, Accumulating Knowledge, Changing the State of Variables, Changing Compound Values.

NA Pages

A Gentle Introduction to Programming (A. Cumming)

Currently this section contains no detailed description for the page, will update this page soon.

Pages

The Programmers Stone (Alan Colston)

Currently this section contains no detailed description for the page, will update this page soon.

Pages

Programming from Specifications (Carroll Morgan)

Currently this section contains no detailed description for the page, will update this page soon.

Pages