Regular LPDC codes with guaranteed minimal Hamming distance
From MaRDI portal
Publication:5376341
DOI10.25596/JALC-2018-271zbMATH Open1414.94928MaRDI QIDQ5376341FDOQ5376341
Authors: Paul-Patrick Nordmann, M. Goessel 
Publication date: 17 September 2018
Recommendations
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- On ensembles of low-density parity-check codes: asymptotic distance distributions
- Low-density parity-check codes based on Steiner systems and permutation matrices
- Efficient encoding of low-density parity-check codes
This page was built for publication: Regular LPDC codes with guaranteed minimal Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376341)
