Construction of minimal binary linear codes with dimension n+3
From MaRDI portal
Construction of minimal binary linear codes with dimension \(n+3\)
Cites work
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A construction of binary linear codes from Boolean functions
- A Construction of Minimal Linear Codes From Partial Difference Sets
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes from simplicial complexes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Minimal Binary Linear Codes
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Minimal Linear Codes From Characteristic Functions
- 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 minimal and quasi-minimal linear codes
- On One-Dimensional Linear Minimal Codes Over Finite (Commutative) Rings
- Secret sharing schemes from three classes of linear codes
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- The parameters of minimal linear codes
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Towards secure two-party computation from the wire-tap channel
This page was built for publication: Construction of minimal binary linear codes with dimension \(n+3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995243)
