Distance Bounds for an Ensemble of LDPC Convolutional Codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1504653
- On ensembles of low-density parity-check codes: asymptotic distance distributions
- 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
- Some convolutional codes whose free distances are maximal
Cited in
(12)- Construction of LDPC convolutional codes via difference triangle sets
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- Distance distributions in ensembles of irregular low-density parity-check codes
- An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
- scientific article; zbMATH DE number 1504653 (Why is no real title available?)
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
- Asymptotically good convolutional codes
- scientific article; zbMATH DE number 4183337 (Why is no real title available?)
- Rate amplification and query-efficient distance amplification for linear LCC and LDC
- Minimum distance and pseudodistance lower bounds for generalised LDPC codes
- On the error-correcting capability of LDPC codes
This page was built for publication: Distance Bounds for an Ensemble of LDPC Convolutional Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549108)
