Media Summary: Motivation and set-up for error correcting Recap of Elias-Bassalygo bound and Johnson radius; Reed-Muller Administrivia; Examples (guessing hats, secret sharing, pool testing); Hamming's Problem Notes: ...

Css 318 1 Coding Theory - Detailed Analysis & Overview

Motivation and set-up for error correcting Recap of Elias-Bassalygo bound and Johnson radius; Reed-Muller Administrivia; Examples (guessing hats, secret sharing, pool testing); Hamming's Problem Notes: ... NOTE: I made an error in the argument presented in the proof of Elias-Bassalygo bound (this occurs between 0:57:00 -- NOTE: I made an error while stating the Schwartz-Zippel Lemma (this occurs between 06:00-07:05 in the above video). The notes ... Introduction to list-decoding; limits on rates of list-decodable

Photo Gallery

Lecture 1 Video 1: Motivation and the basic problem
[CSS.318.1] Coding Theory Lecture 04: What can and cannot be done
[CSS.318.1] Coding Theory Lecture 02: Coding theory basics
[CSS.318.1] Coding Theory Lecture 08: Reed-Muller Codes
[CSS.318.1] Coding Theory Lecture 01: Introduction and Hamming's Problem
[CSS.318.1] Coding Theory Lecture 07: BCH Codes
[CSS.318.1] Coding Theory Lecture 05: Bounds on Codes
[CSS.318.1] Coding Theory Lecture 11: Decoding Concatenated Codes
[CSS.318.1] Coding Theory Lecture 20: Locally Recoverable Codes
[CSS.318.1] Coding Theory Lecture 18: Decoding Reed-Muller codes
[CSS.318.1] Coding Theory Lecture 15: Combinatorics of List-decoding
[CSS.318.1] Coding Theory Lecture 12: GMD Decoding
View Detailed Profile
Lecture 1 Video 1: Motivation and the basic problem

Lecture 1 Video 1: Motivation and the basic problem

Motivation and set-up for error correcting

[CSS.318.1] Coding Theory Lecture 04: What can and cannot be done

[CSS.318.1] Coding Theory Lecture 04: What can and cannot be done

Shannon's converse

[CSS.318.1] Coding Theory Lecture 02: Coding theory basics

[CSS.318.1] Coding Theory Lecture 02: Coding theory basics

Coding theory

[CSS.318.1] Coding Theory Lecture 08: Reed-Muller Codes

[CSS.318.1] Coding Theory Lecture 08: Reed-Muller Codes

Recap of Elias-Bassalygo bound and Johnson radius; Reed-Muller

[CSS.318.1] Coding Theory Lecture 01: Introduction and Hamming's Problem

[CSS.318.1] Coding Theory Lecture 01: Introduction and Hamming's Problem

Administrivia; Examples (guessing hats, secret sharing, pool testing); Hamming's Problem Notes: ...

[CSS.318.1] Coding Theory Lecture 07: BCH Codes

[CSS.318.1] Coding Theory Lecture 07: BCH Codes

BCH

[CSS.318.1] Coding Theory Lecture 05: Bounds on Codes

[CSS.318.1] Coding Theory Lecture 05: Bounds on Codes

NOTE: I made an error in the argument presented in the proof of Elias-Bassalygo bound (this occurs between 0:57:00 --

[CSS.318.1] Coding Theory Lecture 11: Decoding Concatenated Codes

[CSS.318.1] Coding Theory Lecture 11: Decoding Concatenated Codes

Vanilla decoding concatenated

[CSS.318.1] Coding Theory Lecture 20: Locally Recoverable Codes

[CSS.318.1] Coding Theory Lecture 20: Locally Recoverable Codes

Locally recoverable

[CSS.318.1] Coding Theory Lecture 18: Decoding Reed-Muller codes

[CSS.318.1] Coding Theory Lecture 18: Decoding Reed-Muller codes

NOTE: I made an error while stating the Schwartz-Zippel Lemma (this occurs between 06:00-07:05 in the above video). The notes ...

[CSS.318.1] Coding Theory Lecture 15: Combinatorics of List-decoding

[CSS.318.1] Coding Theory Lecture 15: Combinatorics of List-decoding

Introduction to list-decoding; limits on rates of list-decodable

[CSS.318.1] Coding Theory Lecture 12: GMD Decoding

[CSS.318.1] Coding Theory Lecture 12: GMD Decoding

Forney's GMD decoding; Graph-based

CODING THEORY AND MODULAR ARITHMETIC

CODING THEORY AND MODULAR ARITHMETIC

... decryption Okay so lesson number