Asymptotic and finite-length analysis of low-density parity-check codes
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.
Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...
Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q+1,−q+3, . . . , q−1}, known concept ...
We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...
Institute of Electrical and Electronics Engineers2013
A challenging problem related to the design of polar codes is "robustness against channel parameter variations'', as stated in Arıkan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as a mismatch decodi ...
In this paper we study a particular class of generalized Reed-Solomon codes and introduce encoding and decoding algorithms for such codes that speed up current hardware implementations by a factor p wherein p can be any divisor of the size of the multiplic ...
In their recent paper, Chang et al. presented a method for iterative decoding of FEC-based multiple description codes in image transmission. In this correspondence we clarify that an outer interleaver used in the above work was previously proposed for the ...
Institute of Electrical and Electronics Engineers2013
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly usef ...
Institute of Electrical and Electronics Engineers2013
Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...
This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in effici ...
Polar codes provably achieve the capacity of a wide array of channels under successive decoding. However, in terms of some practical aspects, these codes do not perform optimally and need further improvement. In this paper, we consider two such aspects: un ...
