LDPC codes achieve list decoding capacity
From MaRDI portal
Cited in
(6)- Pseudorandom linear codes are list-decodable to capacity
- When can an expander code correct (n) errors in O(n) time?
- Distributing keys and random secrets with constant complexity
- A criterion for decoding on the binary symmetric channel
- Bolt: faster SNARKs from sketched codes
- Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound
This page was built for publication: LDPC codes achieve list decoding capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944006)