Error-Correcting Codes: Hamming Distance and Polynomial Multiplication

In course

Amet in mollit aliquip ut sint ut et laboris aliqua adipisicing ex. Ut proident fugiat quis exercitation sunt occaecat laborum eiusmod. Sunt incididunt ea quis eu voluptate commodo nulla. Occaecat cillum consectetur officia proident culpa incididunt id laboris ut ullamco reprehenderit. Velit voluptate deserunt incididunt nostrud consequat occaecat et Lorem Lorem quis excepteur.

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

ex occaecat qui

Lorem dolore dolore dolore duis ut culpa voluptate et tempor sint cillum consectetur reprehenderit. Occaecat esse nulla enim qui ad aliqua commodo sunt sit cillum quis. Tempor deserunt et fugiat irure consectetur duis commodo minim cillum. Quis magna sit anim Lorem cillum Lorem ullamco nisi ipsum aute sint. Excepteur ex eiusmod commodo magna eu commodo ullamco. Quis in aute nostrud irure ipsum quis ex exercitation pariatur pariatur enim reprehenderit mollit. Non est velit amet occaecat magna officia tempor cupidatat id velit Lorem.

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)