Low-complexity error correction of Hamming-code-based LDPC codes
From MaRDI portal
(Redirected from Publication:734298)
Recommendations
- On the error-correcting capability of LDPC codes
- Erasure correction by low-density codes
- scientific article; zbMATH DE number 3559420
- Nonuniform Error Correction Using Low-Density Parity-Check Codes
- scientific article; zbMATH DE number 2174281
- scientific article; zbMATH DE number 3251924
- Lowering the Error Floor of LDPC Codes Using Cyclic Liftings
- scientific article; zbMATH DE number 4216926
Cites work
- A recursive approach to low complexity codes
- Asymptotically optimal switching circuits
- Error exponents of expander codes
- Expander codes
- scientific article; zbMATH DE number 3554138 (Why is no real title available?)
- scientific article; zbMATH DE number 3559420 (Why is no real title available?)
- Mathematical analysis of an iterative decoding algorithm for low-density codes
- On codes from hypergraphs.
- On expander codes
Cited in
(7)- Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- A low rate coding and decoding scheme based on the LDPC-BCH graph
- On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm
- Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- On the error-correcting capability of LDPC codes
This page was built for publication: Low-complexity error correction of Hamming-code-based LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734298)
