Wide minimal binary linear codes from the general Maiorana-Mcfarland class
From MaRDI portal
Publication:2035453
DOI10.1007/s10623-021-00883-7zbMath1469.94150OpenAlexW3158942388MaRDI QIDQ2035453
Fengrong Zhang, Enes Pašalić, R. S. Rodriguez, Yongzhuang Wei
Publication date: 24 June 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00883-7
Cites Work
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- On ``bent functions
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Minimal linear codes over finite fields
- Minimal linear codes arising from blocking sets
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Several classes of Boolean functions with few Walsh transform values
- A family of difference sets in non-cyclic groups
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Minimal Linear Codes From Characteristic Functions
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Minimal Linear Codes in Odd Characteristic
This page was built for publication: Wide minimal binary linear codes from the general Maiorana-Mcfarland class
