Publication

Extended Polar Codes Perform Better in Terms of Compound Rate and Scaling Behavior

Seyed Hamed Hassani
2013
Conference Papers

Abstract

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. However, in terms of some practical aspects, these codes do not perform optimally and need further improvement. In this paper, we consider two such aspects: universality and finite-length scaling. We argue analytically that for extensions of polar codes that are based on l x l matrices, these aspects become optimal as l grows large.

Official source

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.

Seyed Hamed Hassani
2013
Conference Papers

Abstract

Official source

Related concepts (23)

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.

Code

In communications and information processing, code is a system of rules to convert information—such as a letter, word, sound, image, or gesture—into another form, sometimes shortened or secret, for communication through a communication channel or storage in a storage medium. An early example is an invention of language, which enabled a person, through speech, to communicate what they thought, saw, heard, or felt to others. But speech limits the range of communication to the distance a voice can carry and limits the audience to those present when the speech is uttered.

Related publications (28)

Extended Polar Codes Perform Better in Terms of Compound Rate and Scaling Behavior

Chat with Graph Search

Bridging Monte Carlo worlds: a new framework for accelerator simulations applied on shielding and machine protection studies

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Symmetry in design and decoding of polar-like codes