Computer Science BooksPrograming 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):

sNA Pages
Similar Books
Notes on Coding Theory by J.I.Hall

Notes on Coding Theory by J.I.Hall

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.

s204 Pages
Introduction to Programming Lectures Notes

Introduction to Programming Lectures Notes

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.

sNA Pages
Course Notes on Coding Theory

Course Notes on Coding Theory

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.

sNA Pages
Theory     in Programming Practice (PDF 250P)

Theory in Programming Practice (PDF 250P)

Covered topics are: Text Compression, Error Detection and Correction, Cryptography, Finite State Machines, Recursion and Induction, Relational Database, String Matching and Parallel Recursion.

s250 Pages
Programming from the Ground Up (J. Bartlett)

Programming from the Ground Up (J. Bartlett)

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.

s326 Pages
A Gentle Introduction to Programming (A. Cumming)

A Gentle Introduction to Programming (A. Cumming)

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

s Pages
Designing and Building Parallel Programs (I. Foster)

Designing and Building Parallel Programs (I. Foster)

This book provides a practitioner's guide for students, programmers, engineers, and scientists who wish to design and build efficient and cost-effective programs for parallel and distributed computer systems. It covers the following topics: Parallel Computers and Computation, Designing Parallel Algorithms, Quantitative Basis for Design, Putting Components Together, Tools, Fortran M, High Performance Fortran, Message Passing Interface and Performance Tools.

sNA Pages
How to Think Like a Computer Scientist

How to Think Like a Computer Scientist

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

s Pages
Learn to Program A Tutorial for the Future Programmer (Chris Pine)

Learn to Program A Tutorial for the Future Programmer (Chris Pine)

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

s Pages
Patterns for Adaptive Programming (AP)

Patterns for Adaptive Programming (AP)

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

s Pages