Publication

Polar coding for arbitrary DMCs

Emre Telatar, Rajai Nasser
2013
Report or working paper

Abstract

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. The block error probability under successive cancellation decoding decays exponentially with the square root of the block length. It is shown that the same technique can be used to construct polar codes for arbitrary multiple access channels (MAC) by using an appropriate Abelian group structure.

Official source

https://infoscience.epfl.ch/record/183335?ln=en

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 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.

Polar coding for arbitrary DMCs

Graph Chatbot

Chat with Graph Search

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Polarization and Channel Ordering: Characterizations and Topological Structures

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

Polarization and Channel Ordering: Characterizations and Topological Structures