Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Rüdiger Urbanke, Seyed Hamed Hassani
2013
Journal Articles

Abstract

We consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over a binary-input memoryless symmetric channel W. In particular, we study the asymptotics of the cumulative distribution, P(Z(n) 2.

Official source

https://infoscience.epfl.ch/entities/publication/cf23fc5e-e1b3-4132-8bc5-bbe43c9b7544

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.

Rüdiger Urbanke, Seyed Hamed Hassani
2013
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/cf23fc5e-e1b3-4132-8bc5-bbe43c9b7544

About this result

Related concepts (25)

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Low-density parity-check code

In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel. An LDPC code is constructed using a sparse Tanner graph (subclass of the bipartite graph). LDPC codes are , which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical maximum (the Shannon limit) for a symmetric memoryless channel.

Block code

In coding theory, block codes are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples for block codes, many of which have a wide range of practical applications. The abstract definition of block codes is conceptually useful because it allows coding theorists, mathematicians, and computer scientists to study the limitations of all block codes in a unified way.

Related publications (30)

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Graph Chatbot

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

A story of two transitions: From adhesive to abrasive wear and from ductile to brittle regime

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