Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
From MaRDI portal
Publication:2291661
DOI10.1007/s10623-019-00682-1zbMath1439.11295OpenAlexW2979232646MaRDI QIDQ2291661
Publication date: 31 January 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00682-1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Boolean functions (94D10)
Related Items (6)
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Minimal linear codes constructed from functions ⋮ The parameters of minimal linear codes ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class ⋮ A family of linear codes from constant dimension subspace codes
Cites Work
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Three-weight cyclic codes and their weight distributions
- How to build robust shared control systems
- Linear codes from simplicial complexes
- Minimal linear codes over finite fields
- The separation of binary relative three-weight codes and its applications
- On relative constant-weight codes
- Three classes of linear codes with two or three weights
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- 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
- 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
- Minimal Linear Codes in Odd Characteristic
This page was built for publication: Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
