Variations on minimal codewords in linear codes
From MaRDI portal
Recommendations
Cited in
(23)- Optimal codes from Fibonacci polynomials and secret sharing schemes
- On the minimum size of some minihypers and related linear codes
- Minimal linear codes over finite fields
- Hamming weight distributions of multi-twisted codes over finite fields
- Minimal linear codes constructed from functions
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- The optimal linear secret sharing scheme for any given access structure
- Yet another variation on minimal linear codes
- The parameters of minimal linear codes
- Variations on minimal linear codes
- The maximum number of minimal codewords in an \([n,k]\)-code
- Minimal supports in linear codes
- Minimal vectors in linear codes
- Complete weight enumerators of a family of three-weight linear codes
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Secret sharing schemes from binary linear codes
- Minimal linear codes constructed from partial spreads
- Minimal codewords: an application of relative four-weight codes
- Linear codes from quadratic forms
- Two new families of linear codes with five Lee-weights over \(\mathbb{F}_q + u \mathbb{F}_q\) and their Gray images
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Binary t-divisible codes via simplicial complexes and their applications
This page was built for publication: Variations on minimal codewords in linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352786)
