Computer Science BooksPrograming Theory Books

Algorithmic Introduction to Coding Theory

Advertisement

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
Programming Fundamentals by Kenneth Leroy Busbee

Programming Fundamentals by Kenneth Leroy Busbee

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.

s424 Pages
Theory in Programming Practice

Theory in Programming Practice

This note explains the following topics: Text Compression, Error Detection and Correction, Cryptography, Finite State Machines, Recursion and Induction, Relational Database.

s250 Pages
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
Programming Language Concepts Lecture Notes

Programming Language Concepts Lecture Notes

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.

s182 Pages
Learning to Program (Alan Gauld)

Learning to Program (Alan Gauld)

Simple Sequences, The Raw Materials, Loops, Branching, Modules & Functions, Handling Files, Handling Text, Error Handling, Regular Expressions, Object Oriented Programming, Event Driven Programming, GUI Programming, Recursion, Python in Practice, Working with Databases, Using the Operating System, Inter-process communications and Network programming.

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
Programming from Specifications (Carroll Morgan)

Programming from Specifications (Carroll Morgan)

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

Advertisement