Publication

Polarization Theorems for Arbitrary DMCs

Emre Telatar, Rajai Nasser
2013
Conference Papers

Abstract

A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (DMC) by imposing a quasigroup structure on the input alphabet. The same technique is used to derive a polarization theorem for an arbitrary multiple access channel (MAC) by using an appropriate Abelian group structure. These results can be used to construct capacity-achieving polar codes for arbitrary DMCs with a block error probability of o(2 -N1/2-ε), and an encoding/decoding complexity of O(N log N), where N is the block length. © 2013 IEEE.

Official source

https://infoscience.epfl.ch/entities/publication/1766b8c9-b2b9-432d-96d2-556fc535f321

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.

Graph Chat

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.

Polarization Theorems for Arbitrary DMCs

Chat with Graph Search

Turbo Product Code-aided Spatiotemporal 2-d Coded Mimo for Urllc

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation