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

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

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

Tobias Kippenberg, Martin Hubert Peter Pfeiffer, Fatemeh Alishahi, Arne Kordts, Maxim Karpov, Ahmad Fallahpour

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

OPTICAL SOC AMER2020

A New Coding Paradigm for the Primitive Relay Channel

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

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

2019

Bits through Time

Elie Najm

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

EPFL2019

Reed-Muller codes polarize

Emmanuel Abbé, Min Ye

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

IEEE COMPUTER SOC2019

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

Rüdiger Urbanke, Kirill Ivanov

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

IEEE2019

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

Nikolaos Stergiopoulos, Dimitrios Schizas

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

MOSBY-ELSEVIER2019

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

Tobias Kippenberg, Martin Hubert Peter Pfeiffer, Fatemeh Alishahi, Arne Kordts, Maxim Karpov, Ahmad Fallahpour

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

SPIE-INT SOC OPTICAL ENGINEERING2019

Gaussian channel transmission of images and audio files using cryptcoding

Vladimir Ilievski

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

2019

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Compute–Forward Multiple Access (CFMA): Practical Implementations

Michael Christoph Gastpar, Adriano Pastore, Jingge Zhu, Erixhen Sula, Sung Hoon Lim

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

2019

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

Wei Liu

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

EPFL2019

Page 2 sur 2