The following pages link to (Q3428807):
Displayed 8 items.
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Minimum number of affine simplices of given dimension (Q476315) (← links)
- Counting minimal reactions with specific conditions in \(\mathbb R^4\) (Q537981) (← links)
- Support sets in exponential families and oriented matroid theory (Q541842) (← links)
- On the maximum number of minimal codewords (Q2037586) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head (Q6190150) (← links)