Publications related to Raptor Codes

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 discuss how the combination of experimental observations and rapid modeling has enabled to improve understanding of the tokamak ramp-down phase in ASDEX Upgrade. A series of dedicated experiments has been performed, to disentangle the effect of individu ...

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

Rapid inter-discharge simulation and optimization using the RAPTOR code have allowed the development of a reliable and reproducible early heating strategy for an advanced tokamak (AT) scenario on ASDEX Upgrade. Solving for electron heat and current diffusi ...

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

Achieving a successful plasma current ramp-up in a full tungsten tokamak can be challenging due to the large core radiation (and resulting low core temperature) that can be faced with this heavy metallic impurity if its relative concentration is too high. ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. P ...

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding ...

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms ...

Techniques are disclosed for adaptive coding and scheduling of packets in wireless networks. The adaptive coding and scheduling can be achieved by utilizing a discrete water filling (DWF) scheme. In an example, a computer-implemented method to adaptively c ...

Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference. Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...

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

For any prime power q, Mori and Tanaka introduced a family of q-ary polar codes based on the q x q Reed-Solomon polarization kernels. For transmission over a q-ary erasure channel, they also derived a closed-form recursion for the erasure probability of ea ...

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...

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

Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...

In this letter, we describe an LDPC code design framework for the unequal power two-user Gaussian multiple access channel using EXIT charts. We show that the sumrate of the LDPC codes designed using our approach can get close to the maximal sum-rate of the ...

We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for suitable boundary c ...

Raptor Codes

Chat with Graph Search

Scenario optimization for the tokamak ramp-down phase in RAPTOR: A. Analysis and model validation on ASDEX Upgrade

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

Inter-discharge optimization for fast, reliable access to ASDEX Upgrade advanced tokamak scenario

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

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Healing plasma current ramp-up by nitrogen seeding in the full tungsten environment of WEST

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

Optima Age Over Erasure Channels

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Network coded multipath and related techniques

Cooperative Data Exchange and Private Information Retrieval

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

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

New Results On The Pseudoredundancy

Compute–Forward Multiple Access (CFMA): Practical Implementations

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

The Velocity of the Propagating Wave for Spatially Coupled Systems With Applications to LDPC Codes