New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling
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.
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 study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the use ...
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 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 ...
We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...
We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns ...
We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting bit-error probability as the length o ...
The idea to use error-correcting codes in order to construct public key cryptosystems was published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa codes, but various later publications suggested the use of different familie ...
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 ...
