Pages that link to "Item:Q3549108"
From MaRDI portal
The following pages link to Distance Bounds for an Ensemble of LDPC Convolutional Codes (Q3549108):
Displaying 6 items.
- On the error-correcting capability of LDPC codes (Q734256) (← links)
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283) (← links)
- An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes (Q3547991) (← links)
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity (Q3548869) (← links)
- Asymptotically good convolutional codes (Q5378516) (← links)
- Rate amplification and query-efficient distance amplification for linear LCC and LDC (Q6115352) (← links)