Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
From MaRDI portal
Publication:2120998
DOI10.1007/s12095-021-00491-1zbMath1492.94205OpenAlexW3160198219MaRDI QIDQ2120998
Fengrong Zhang, R. S. Rodriguez, Yongzhuang Wei, Enes Pašalić
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00491-1
Related Items (1)
Cites Work
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- Minimal linear codes over finite fields
- Minimal linear codes arising from blocking sets
- Recent results and problems on constructions of linear codes from cryptographic functions
- A geometric characterization of minimal codes and their asymptotic performance
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular plateaued balanced functions
- 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\)
- The parameters of minimal linear codes
- On Minimal and Quasi-minimal Linear Codes
- 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 Some 2-Designs
- 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
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- 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: Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
