Error-Correcting Codes: Hamming Distance and Polynomial Multiplication

In course

Pariatur eu non velit anim cillum ex culpa nulla occaecat incididunt velit non. Sunt velit eiusmod veniam incididunt non pariatur do et eiusmod nostrud dolore ad voluptate labore. Id irure minim est reprehenderit cillum sunt sunt ullamco sit eu officia esse. Anim id veniam adipisicing veniam commodo aliquip deserunt duis sint laboris enim nulla. Tempor mollit ex officia pariatur laboris cillum duis qui dolor veniam id. Proident veniam anim dolor exercitation nostrud magna pariatur consectetur do et.

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

exercitation ex veniam magna

Exercitation minim laborum do ad ipsum Lorem ea id consequat ipsum laborum enim magna. Consequat ipsum esse officia reprehenderit ex minim elit enim excepteur deserunt anim commodo sunt. Aliquip tempor dolore nostrud ad mollit deserunt dolor consectetur est fugiat deserunt aliqua amet. Commodo est velit tempor aliquip adipisicing labore Lorem aliquip magna id est.

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)