Minimal linear codes from vectorial functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A Construction of Minimal Linear Codes From Partial Difference Sets
- A construction of binary linear codes from Boolean functions
- A geometric characterization of minimal codes and their asymptotic performance
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Complete weight enumerators of a family of three-weight linear codes
- Explicit Criteria for Construction of Plateaued Functions
- Five classes of optimal two-weight linear codes
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Infinite families of minimal binary codes via Krawtchouk polynomials
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes with two or three weights from quadratic bent functions
- Minimal Binary Linear Codes
- Minimal Binary Linear Codes From Vectorial Boolean Functions
- Minimal Linear Codes From Characteristic Functions
- Minimal \(p\)-ary codes via the direct sum of functions, non-covering permutations and subspaces of derivatives
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes arising from blocking sets
- Minimal linear codes constructed from functions
- Minimal linear codes constructed from partial spreads
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes in odd characteristic
- Minimal linear codes over finite fields
- Minimal vectors in linear codes
- Nonlinearities of S-boxes
- On minimal and quasi-minimal linear codes
- On the weight distribution of some minimal codes
- Outer strong blocking sets
- Secret sharing schemes from three classes of linear codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Shortened Linear Codes From APN and PN Functions
- Small Strong Blocking Sets by Concatenation
- 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
- Two New Families of Two-Weight Codes
- Two classes of two-weight linear codes
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
This page was built for publication: Minimal linear codes from vectorial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874207)
