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.
This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...
In this paper we investigate the behaviour of iteratively decoded low-density parity-check codes over the binary erasure channel in the so-called "waterfall region". We show that, according to a simplified model, the performance curves in this region follo ...
A method and apparatus for efficient list decoding of Reed-Solomon error correction codes. A polynomial for a predetermined target list size combining points of an error code applied to a message and points of a received word is determined for a k dimensio ...
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping al ...
A novel embedded wavelet coding scheme is proposed for the transmission of images over unreliable channels. The proposed scheme is based on the partitioning of information into a number of layers which can be decoded independently provided that some import ...
Institute of Electrical and Electronics Engineers2003
What makes a source–channel communication system optimal? It is shown that in order to achieve an optimal cost–distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distri ...
We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...
This paper starts a systematic study of capacity-achieving (c.a.) sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes. We sho ...
Within the validation work of EGNOS for civil aviation, it is interesting to analyze the transmitted corrections individually. In this paper, the ionospheric model of EGNOS is compared to the one determined by an independent organization (CODE). The contin ...
A number of codes are in use at JET to model the edge plasma. The range of edge codes is described as is the range of physics issues being explored by these codes. The balance between focussed modelling (that looking at particular physics effects) and inte ...
