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 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 ...
This paper exhibits a class of universal Raptor codes: for a given integer k, and any real /spl epsiv/>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + /spl epsiv/) is sufficient t ...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...
Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...
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ε ...
We construct new families of error-correcting codes based on Gallager's (1973) low-density parity-check codes. We improve on Gallager's results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these co ...
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
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 ...
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 ...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...