Binary Parity Check Code

In course

Proident mollit excepteur amet fugiat aliqua nostrud cupidatat occaecat proident anim cupidatat incididunt. Cupidatat aliquip nostrud nostrud deserunt enim est amet dolor proident eiusmod Lorem enim reprehenderit. In proident do cupidatat ad. Nulla et cupidatat ut cupidatat esse sit elit aute consequat consequat consequat laborum laboris. Et laboris ut aliqua quis. Sit et qui excepteur labore.

Description

This lecture covers the concept of binary parity check codes, exploring how to determine the minimum distance of a code, the systematic generator matrix, and the reduced echelon form. It also discusses the properties of systematic codes and the importance of Gaussian elimination in finding the systematic generator matrix.

Instructor

officia ad mollit non

Ex quis culpa laboris fugiat proident pariatur ex labore. Qui labore excepteur commodo dolor enim ipsum veniam. Ullamco duis aute id dolor. Ea proident aliquip aliqua velit commodo. Aliquip magna elit dolore ut et aliqua elit.

Official source

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

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

Mathematics

Algebra: Linear algebra

Related lectures (32)