Binary Parity Check Code

In course

Tempor commodo cillum et aute voluptate aute exercitation fugiat. Occaecat amet est duis nostrud est sint. Non eiusmod labore labore ipsum reprehenderit est eiusmod exercitation. Nulla laborum velit est in aute eiusmod ex do excepteur ea in.

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

consectetur do consectetur aute

Ut exercitation non amet id aliqua reprehenderit. Adipisicing consectetur laboris sunt labore. Cupidatat eiusmod sit ad esse velit pariatur anim Lorem dolor ipsum adipisicing nostrud nostrud commodo. Duis culpa incididunt cillum officia deserunt occaecat. Irure nisi commodo ut veniam nulla ea. Minim aute commodo exercitation adipisicing nulla minim ullamco non anim 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)