The following pages link to Minimal vectors in linear codes (Q4701180):
Displayed 7 items.
- Even poset and a parity result for binary linear code (Q855546) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- Implementing gradient descent decoding (Q1024881) (← links)
- On the non-minimal codewords in binary Reed-Muller codes (Q1811092) (← links)
- Minimal codewords in Reed-Muller codes (Q2267792) (← links)
- Extensions of the critical theorem (Q2581403) (← links)
- (Q2741451) (← links)