On the construction of some capacity-approaching coding schemes

By Sae-Young Chung. 2000

394 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/6d90d6080fdf55811c1d8f0e75c04849c6f33bde

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Density evolution for two improved BP-Based decoding algorithms of LDPC codes (2002, methodology): “The density evolution algorithm was applied in [5] and [6] to the BP-based decoding algorithm, and in [7] to modified versions of the latter based on corrective terms.”
Capacity-approaching protograph codes (2009, methodology): “Iterative decoding thresholds for the BI-AWGN channel can be obtained via a fast and accurate approximation to density evolution originally proposed by Chung et al. in [ 17 ].”
Reduced-complexity decoding of LDPC codes (2005, methodology): “D) lookup table can be used to implement the tanh rule [13].”
Design of efficiently encodable moderate-length high-rate irregular LDPC codes (2004, methodology): “With LDPC codes so parameterized, it is shown in [3] and [6] how optimum degree distributions and may be obtained via algorithms centered on the evolution of the probability density functions (pdfs) of the messages passed between the two node types in the belief-propagation decoder.”
Rate-compatible puncturing of low-density parity-check codes (2004, methodology): “In addition, we design another puncturing distribution with a 1=2-rate LDPC code from [11] which has a degree distribution pair (x) = 0:23403x+ 0:21242x(2) + 0:14690x(5) + 0:10284x(6) + 0:30381x(19) and (x) = 0:71875x(7) + 0:28125x(8): The puncturing distributions are obtained with linear programmin”
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation (2001, background): “Since the output message of a variable node is characterized by its mean, which is the sum of the means of the incoming densities, we need to keep only the mean of the Gaussian mixture from check nodes to variable nodes.”
Compression of binary sources with side information at the decoder using LDPC codes (2002, methodology): “Much better results are expected from LDPC codes with improved irregular code design [9], [11]–[13].”