Pages that link to "Item:Q5055921"
From MaRDI portal
The following pages link to The complexity of error-correcting codes (Q5055921):
Displaying 4 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- Complexity of constructing codes with specified correction properties (Q1140596) (← links)
- On the Trustworthiness of Error-Correcting Codes (Q3549110) (← links)