Analysis of Spatially Coupled Systems using the Potential Functional with Applications to Coding Theory
Graph Chatbot
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.
In this paper a class of discretized piecewise linear chaotic maps of a very high dimensions are used for communication over a noisy channel. An information payload that is sent over a channel is controlled in the transmitter and is related to the symbolic ...
This paper presents an unequal error protection scheme for atomic image bitstreams. An atomic stream is the encoded version of a digital image, which is represented as a sum of bi-dimensional functions, as typically generated by Matching Pursuit encoders. ...
In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message updat ...
We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the Q-ary symmetric channel for large Q. We will show that for any m and any ϵ the new algorithms can decode up to a fraction of at ...
In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...
This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...
The goal of this project is to present the main list-decoding algorithms for Reed-Solomon codes, implement them and study more specifically some of their properties and possible improvements. ...
Transmission of packets over computer networks is subject to packet-level errors, which appear as "bursts" of bit-level errors and are not well modeled by memoryless binary channels. A standard scrambling technique is used for transmission of packets by th ...
This paper presents an error resilient coding scheme for atomic image bitstreams, as generated by Matching Pursuit encoders. A joint source and channel coding algorithm is proposed, that takes benefit of both the flexibility in the image representation, an ...
A novel image transmission scheme is proposed for the communication of SPIHT image streams over wireless channels. The proposed scheme employs turbo codes and Reed-Solomon codes in order to deal effectively with burst errors. An algorithm for the optimal u ...
Institute of Electrical and Electronics Engineers2005
