Minimal linear codes constructed from functions
From MaRDI portal
Publication:2154886
DOI10.1007/s12095-021-00553-4zbMath1501.94099arXiv1911.11632WikidataQ114849172 ScholiaQ114849172MaRDI QIDQ2154886
Publication date: 15 July 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.11632
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes from a generic construction
- 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
- Complete weight enumerators of a family of three-weight linear codes
- Binary linear codes with two or three weights from Niho exponents
- 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
- 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
- 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\)
- Two classes of two-weight linear codes
- 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
- Towards Secure Two-Party Computation from the Wire-Tap Channel
- The hardness of decoding linear codes with preprocessing
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- Two New Families of Two-Weight 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
