Minimal linear codes constructed from partial spreads
From MaRDI portal
Publication:6571309
Recommendations
Cites work
- scientific article; zbMATH DE number 1057740 (Why is no real title available?)
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- A Construction of Minimal Linear Codes From Partial Difference Sets
- A family of linear codes from constant dimension subspace codes
- A geometric characterization of minimal codes and their asymptotic performance
- An inductive construction of minimal codes
- Bent partitions
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Minimal Binary Linear Codes
- Minimal linear codes arising from blocking sets
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes in odd characteristic
- Minimal linear codes over finite fields
- Minimal vectors in linear codes
- On cutting blocking sets and their codes
- On maximal symplectic partial spreads
- On minimal and quasi-minimal linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- Secret sharing schemes from three classes of linear codes
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- The dimension and minimum distance of two classes of primitive BCH codes
- The hardness of decoding linear codes with preprocessing
- The parameters of minimal linear codes
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Three combinatorial perspectives on minimal codes
- Towards secure two-party computation from the wire-tap channel
This page was built for publication: Minimal linear codes constructed from partial spreads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571309)