A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

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.

We experimentally demonstrate Kramers-Kronig detection of four 20 Gbaud 16-quadrature-amplitude-modulated (QAM) channels after 50 km fiber transmission using two soliton Kerr combs as signal sources and local oscillators. The estimated carrier phase at the ...

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding tech ...

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are gen ...

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

Objective: One of the factors contributing to complications related to open repair of the aorta is the construction of a hand-sewn anastomosis. Aortic anastomotic devices (AADs), such as the intraluminal ringed graft (IRG), and the anastomotic stenting tec ...

We experimentally demonstrate three-fold wavelength multicasting of a 64-quadrature-amplitude-modulation (QAM), 120-Gbit/s data channel using a microresonator Kerr frequency comb and nonlinear wave mixing. The multicasting is achieved with a data signal an ...

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

A Lower Bound on Achievable Rates by Polar Codes with Mismatch Polar Decoding

Chat with Graph Search

Kramers Kronig detection of four 20 Gbaud 16-QAM channels using Kerr combs for a shared phase estimation

A New Coding Paradigm for the Primitive Relay Channel

Bits through Time

Reed-Muller codes polarize

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

A systematic review and meta-analysis of the efficacy of aortic anastomotic devices

Experimental demonstration of three-fold wavelength multicasting of a 64-QAM 120 Gbit/s data channel using a Kerr frequency comb and nonlinear wave mixing

Gaussian channel transmission of images and audio files using cryptcoding

Construction of Polar Codes With Sublinear Complexity

Compute–Forward Multiple Access (CFMA): Practical Implementations

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