The following pages link to (Q4352786):
Displaying 15 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Complete weight enumerators of a family of three-weight linear codes (Q510420) (← links)
- Secret sharing schemes from binary linear codes (Q621578) (← links)
- Linear codes from quadratic forms (Q681333) (← links)
- Optimal codes from Fibonacci polynomials and secret sharing schemes (Q1690548) (← links)
- Minimal linear codes over finite fields (Q1800699) (← links)
- Hamming weight distributions of multi-twisted codes over finite fields (Q2043410) (← links)
- Minimal linear codes constructed from functions (Q2154886) (← links)
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents (Q2238920) (← links)
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme (Q2309688) (← links)
- The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
- The parameters of minimal linear codes (Q2662039) (← links)
- Minimal supports in linear codes (Q4608492) (← links)
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) (Q6172317) (← links)
