Error Correcting Codes: Combinatorics, Algorithms and Applications

Chapter 2

atri — Tue, 31 Jan 2012 19:39:44 +0000

Chapter 2 of the book has now been uploaded. As usual comments are welcome!

Lect 6: Hamming Bound

atri — Tue, 31 Jan 2012 19:38:02 +0000

On Monday, we proved the Hamming bound, which was our first negative result in the course. Next lecture, we will study (general) linear codes.

Lect 5: Hamming Code

atri — Mon, 30 Jan 2012 01:30:20 +0000

On Friday, we finished the proof of the tight connection between the distance of a code and its error-correctability. We then studied the Hamming code and proved that its distance is . The material was from Sec 1.4 in the book.

Lect 4: Distance of a code

atri — Thu, 26 Jan 2012 19:25:50 +0000

Yesterday, Jesse defined the notion of the distance of a code and mentioned some its consequences. The material was from Sec 1.4 in the book.

Lect 3: More on Parity and Repetition Codes

atri — Wed, 25 Jan 2012 01:41:13 +0000

On Monday, we studied the error correctability (and detectability) of the parity and repetition codes. We also looked at some ways of modeling noise. The material was from Sec 1.3 in the book.

A reminder that tomorrow, Jesse will present the lecture. He will talk about the distance parameter of a code.

Lect 2: Definitions

atri — Fri, 20 Jan 2012 21:32:37 +0000

In today’s lecture we informally stated the big question that will motivate most of what we do this semester and then started with basic definition with the goal of formalizing the big question. The material is from (part of) Sec 1.1, Sec 1.2 and (part of) Sec 1.3

Lect 1: Introduction

atri — Wed, 18 Jan 2012 20:45:49 +0000

In today’s lecture, we mostly we over the syllabus.

We then briefly talked about some practical motivation of codes. The slides for today’s lecture have been uploaded.

Also don’t forget the feedback form!

Feedback Forms

atri — Tue, 17 Jan 2012 03:02:56 +0000

Please fill in this anonymous feedback form so that I have an idea of the background knowledge that this class has. It’ll help me tailor my lectures accordingly.

Further, at any point of time in the semester if you have a comment, feel free to use the anonymous feedback form via the link on the right panel.

Welcome to the class of Spring 2012!

atri — Mon, 16 Jan 2012 22:40:01 +0000

This is the course blog for the Spring 2012 offering of CSE 545, Error Correcting Codes: Combinatorics, Algorithms and Applications at CSE@UB.

If you are a student in the class, it is your responsibility to keep up to date with the blog posts here. Consider subscribing to the RSS feed (click the first button on the right panel). Or sign up for email notifications (button the the right panel).

This should be a fun course for everyone involved and I am looking forward to it!

ps: those who signed up for the blog last year, here is some information in case you want to unsubscribe. (The post is on the blog for another course but the information there will work for this blog.)

Grades have been submitted

atri — Wed, 11 May 2011 15:33:06 +0000

I just submitted the grades for the course.

I uploaded your letter grades as well the scores of the items that I had not graded earlier to UBLearns. I used the following split to calculate the final grade:

Proof-Reading+Scribing: 40%
Homeworks: 25%
Wikipedia: 35%

It was great to have y’all in the class: hope you guys had fun in the course! (I had fun teaching it.)