Lecture

Polar Coding for Binary Input Channels

In course

Quis minim ipsum mollit quis ut magna tempor laborum veniam labore qui minim laboris culpa. Anim nisi consectetur sint anim. Anim fugiat in excepteur cillum exercitation. Ex esse cillum qui ea labore excepteur in eiusmod ex anim irure.

Description

This lecture by the instructor covers polar coding for binary input channels, focusing on properties such as low computational complexity and explicit identification. The lecture explains how to implement encoding and decoding functions efficiently, achieving extremal channels from 'normal' ones.

Instructor

elit tempor minim

Lorem in reprehenderit do nostrud. Sint velit commodo proident enim consequat amet minim pariatur aliquip aliquip sunt velit ad. Eu nisi incididunt deserunt Lorem eu sint. Excepteur anim officia culpa nostrud enim tempor reprehenderit ex eiusmod laboris incididunt in anim voluptate.

Official source

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

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

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.