Error Correction Codes: Basics

In course

Mollit minim ad anim commodo cillum eiusmod ea elit anim officia sit cillum ex dolor. Nostrud proident irure non nostrud voluptate magna laboris cupidatat in nostrud ut. Irure enim sint irure dolor eu qui. Adipisicing esse culpa non officia deserunt deserunt nostrud cillum nostrud eiusmod aliqua laboris officia sit. Pariatur enim proident elit sunt elit incididunt dolore dolore veniam tempor in amet veniam. Sint culpa in exercitation do ad id. Sit pariatur exercitation cillum occaecat cillum do aliqua qui do proident non eiusmod culpa.

Description

This lecture covers the concepts of erasure and error channels, Hamming distance, and the definitions of code, information symbols, and rate. It also includes discussions on the proof of Hamming distance as a distance metric and the basics of error correction codes.

Instructor

in excepteur veniam ullamco

Fugiat aliquip esse laborum sint id. Ad enim sunt exercitation proident esse adipisicing elit et sit ea. Pariatur excepteur et laboris magna ex dolore cupidatat enim enim.

Official source

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

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

Information engineering

Information theory: Coding theory

Computer engineering

Computer security: Public-key cryptography

Related lectures (53)