Minimal binary linear codes: a general framework based on bent concatenation
From MaRDI portal
Publication:2132451
DOI10.1007/s10623-022-01037-zOpenAlexW3207219999WikidataQ114849757 ScholiaQ114849757MaRDI QIDQ2132451
Fengrong Zhang, Enes Pašalić, Yongzhuang Wei, R. S. Rodriguez
Publication date: 28 April 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01037-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- On some permutation binomials and trinomials over \(\mathbb{F}_{2^n}\)
- On ``bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Optimal binary linear codes of length \(\leq 30\)
- 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
- A geometric characterization of minimal codes and their asymptotic performance
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes from Maiorana-McFarland functions
- A note on the minimal binary linear code
- 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
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A family of difference sets in non-cyclic groups
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- On Minimal and Quasi-minimal Linear Codes
- 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
- Optimal Binary Linear Codes From Maximal Arcs
- Minimal Linear Codes From Characteristic Functions
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Boolean Functions for Cryptography and Coding Theory
- Minimal Linear Codes in Odd Characteristic
This page was built for publication: Minimal binary linear codes: a general framework based on bent concatenation
