Posted by: atri | October 15, 2007

Lecture 21: Reed-Muller Codes

Today we looked at Reed-Muller codes, which are multivariate generalizations of the Reed-Solomon codes. We proved a bound on the distance of a class of Reed-Muller codes using the Schwartz-Zippel lemma.

Next lecture, we will look at binary Reed-Muller codes.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: