Variations on minimal linear codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- 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
- Towards secure two-party computation from the wire-tap channel
Cited in
(17)- Minimal linear codes arising from blocking sets
- A geometric characterization of minimal codes and their asymptotic performance
- An inductive construction of minimal codes
- Minimal binary linear codes: a general framework based on bent concatenation
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- Yet another variation on minimal linear codes
- The parameters of minimal linear codes
- Minimal linear codes from Hermitian varieties and quadrics
- On minimal and quasi-minimal linear codes
- scientific article; zbMATH DE number 1057740 (Why is no real title available?)
- Minimal vectors in linear codes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Minimal linear codes in odd characteristic
- Small Strong Blocking Sets by Concatenation
- Geometric dual and sum-rank minimal codes
- Minimal linear codes constructed from partial spreads
- Minimal linear codes constructed from hierarchical posets with two levels
This page was built for publication: Variations on minimal linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460456)