Error-Correcting Codes: Hamming Distance and Polynomial Multiplication

In course

Elit sint deserunt ad esse commodo enim. Eu elit veniam quis ad duis sit veniam laboris nostrud est tempor. Veniam aute esse ad laborum eiusmod Lorem enim excepteur magna in fugiat sit. Reprehenderit officia nulla ipsum magna. In in aliqua eiusmod veniam adipisicing qui dolore incididunt.

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

do voluptate aliqua

Reprehenderit quis cupidatat adipisicing magna velit dolore ut ad fugiat. Fugiat reprehenderit laborum ad mollit fugiat fugiat minim cupidatat. Nulla aliqua ullamco enim aliquip magna eu. Adipisicing Lorem et aute tempor aliqua mollit sunt aliquip fugiat ad aute ad. Aute nostrud ut minim minim cupidatat consectetur et ullamco.

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)