A fast BER evaluation method for LDGM codes
From MaRDI portal
Recommendations
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation
- An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel
- Low-density parity-check codes and the related performance analysis methods
- On the error-correcting capability of LDPC codes
- Performance evaluation of coded modulation schemes based on binary lattices
- Pseudocodeword Performance Analysis for LDPC Convolutional Codes
- A fast encoding method for lattice codes and quantizers
- An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC
- Upper bounds on the rate of LDPC codes
Cites work
- scientific article; zbMATH DE number 3817604 (Why is no real title available?)
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- Design of capacity-approaching irregular low-density parity-check codes
- Efficient erasure correcting codes
- Good error-correcting codes based on very sparse matrices
- LDGM codes for channel coding and joint source-channel coding of correlated sources
Cited in
(4)- The typical performance of irregular low-density generator-matrix codes for lossy compression
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation
- Improved equalization and joint iterative detection
- On the linear combination, product and ratio of normal and Laplace random variables
This page was built for publication: A fast BER evaluation method for LDGM codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609801)