Error-Correcting Codes: Hamming Distance and Polynomial Multiplication

In course

Dolor culpa pariatur laboris eu laboris officia deserunt consequat consectetur incididunt. Ut anim sunt minim reprehenderit et incididunt cupidatat officia nulla cupidatat. Adipisicing adipisicing culpa ad quis. Exercitation esse sit aute occaecat Lorem irure nostrud.

Description

This lecture covers the concepts of error-correcting codes, focusing on Hamming distance, polynomial multiplication, and algebraic fields. Emre Telatar explains the importance of code construction, minimum distance, and the properties of polynomial codes.

Instructor

nulla enim

Aute ad ut tempor culpa. Irure nisi nisi culpa adipisicing dolor anim dolor sunt do Lorem occaecat. Consectetur occaecat eu minim ex nulla Lorem fugiat dolor occaecat cillum.

Official source

https://mediaspace.epfl.ch/media/0_jb4i5tbq

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra, Polynomials

Mathematical logic: Set theory

Information engineering

Information theory: Coding theory

Related lectures (46)