The following pages link to (Q4526974):
Displaying 19 items.
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- The minimum distance of parameterized codes on projective tori (Q429761) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Integer SEC-DED codes for low power communications (Q763546) (← links)
- Key masking using biometry (Q764394) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Linear codes over signed graphs (Q2291662) (← links)
- Affine Cartesian codes (Q2439742) (← links)
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves (Q2701511) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- (Q3783615) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)
- Theoretical proof for the number of errors that one linear code detects/corrects when linear quasigroups of order 4 are used for coding (Q6651086) (← links)
