Yet another variation on minimal linear codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1057740 (Why is no real title available?)
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- Algebraic-geometric codes and asymptotic problems
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Generalized hashing and parent-identifying codes.
- Intersecting codes and separating codes
- Linear intersecting codes
- Minimal vectors in linear codes
- Oblivious transfers and intersecting codes
- On minimal and quasi-minimal linear codes
- On products and powers of linear codes under componentwise multiplication
- Towards secure two-party computation from the wire-tap channel
- Towers of function fields over non-prime finite fields
- Upper Bounds on Separating Codes
- \((2,1)\)-separating systems beyond the probabilistic bound
Cited in
(17)- Variations on minimal linear codes
- A geometric characterization of minimal codes and their asymptotic performance
- Strong blocking sets and minimal codes from expander graphs
- Minimal linear codes constructed from partial spreads
- Linear codes with few weights from weakly regular plateaued functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes arising from blocking sets
- Minimal linear codes over finite fields
- On minimal and quasi-minimal linear codes
- Constructing few-weight linear codes and strongly regular graphs
- Binary linear codes with few weights from Boolean functions
- A novel dynamic and verifiable secret sharing scheme based on linear codes
- An inductive construction of minimal codes
- Minimal linear codes from Hermitian varieties and quadrics
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- On the weight distribution of some minimal codes
This page was built for publication: Yet another variation on minimal linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259266)