Publications related to Fountain code

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

Olivier Sauter, Federico Alberto Alfredo Felici, Simon Van Mulders, Cassandre Ekta Contré, Anna Teplukhina, Bernhard Sieglin

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

Iop Publishing Ltd2024

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

Olivier Sauter, Federico Alberto Alfredo Felici, Simon Van Mulders, Cassandre Ekta Contré, Hartmut Zohm

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

IOP Publishing Ltd2024

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

Olivier Sauter, Federico Alberto Alfredo Felici, Simon Van Mulders

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

2022

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

Alessandro Chiesa

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

SIAM PUBLICATIONS2022

Optima Age Over Erasure Channels

Emre Telatar, Elie Najm, Rajai Nasser

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Network coded multipath and related techniques

Emre Telatar, Arno Schneuwly, Derya Malak

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

2020

An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures

Damian Dudzicz

This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding-window erasure model, with burst and arbitrary losses, introdu ...

2020

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

Rüdiger Urbanke, Henry Pfister

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

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

Scaling and Resilience in Numerical Algorithms for Exascale Computing

Allan Svejstrup Nielsen

The first Petascale supercomputer, the IBM Roadrunner, went online in 2008. Ten years later, the community is now looking ahead to a new generation of Exascale machines. During the decade that has passed, several hundred Petascale capable machines have bee ...

EPFL2018

Coding for Communications and Secrecy

Mani Bastaniparizi

Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...

EPFL2017

Simulation of profile evolution from ramp-up to ramp-down and optimization of tokamak plasma termination with the RAPTOR code

Olivier Sauter, Federico Alberto Alfredo Felici, Antoine Pierre Emmanuel Alexis Merle, Doohyun Kim, Anna Teplukhina, Donghyun Kim

The present work demonstrates the capabilities of the transport code RAPTOR as a fast and reliable simulator of plasma profiles for the entire plasma discharge, i.e. from ramp-up to ramp-down. This code focuses, at this stage, on the simulation of electron ...

2017

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs

Rajai Nasser

We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the standard polar codes of Arikan and Reed-Muller codes. We derive a closed form ...

IEEE2016

Graph-Based Representation and Coding of Multiview Images

Pascal Frossard, Bénédicte Motz

Instead of lossily coding depth images resulting in undesirable geometric distortion, graph-based representation (GBR) describes disparity information as a graph with a controllable accuracy. In this paper, we propose a more compact graphical representatio ...

Ieee2016

Online Fountain Codes With Low Overhead

Mohammad Amin Shokrollahi, Yuval Cassuto

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formaliz ...

Institute of Electrical and Electronics Engineers2015

Low Complexity Scheduling and Coding for Wireless Networks

Siddhartha Brahma

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...

EPFL2015

LLR-Based Successive Cancellation List Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in su ...

Institute of Electrical and Electronics Engineers2015

Reconstruction of Network Coded Sources From Incomplete Datasets

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

We investigate the problem of recovering source information from an incomplete set of network coded data with help of prior information about the sources. This problem naturally arises in wireless networks, where the number of network coded packets availab ...

Institute of Electrical and Electronics Engineers2015

FudgeFactor: Syntax-Guided Synthesis for Accurate RTL Error Localization and Correction

Paolo Ienne, Barbara Jobstmann, David Novo Bruna, Andrew James Becker, Mohsen A A Ewaida

Functional verification occupies a significant amount of the digital circuit design cycle. In this paper, we present a novel approach to improve circuit debugging which not only localizes errors with high confidence, but can also provide semantically-meani ...

Springer2015