Pages that link to "Item:Q4701401"
From MaRDI portal
The following pages link to On the complexity of minimum distance decoding of long linear codes (Q4701401):
Displaying 6 items.
- Integer SEC-DED codes for low power communications (Q763546) (← links)
- Key masking using biometry (Q764394) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- LDPC codes from Singer cycles (Q1026131) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
