A note on the minimal binary linear code
From MaRDI portal
Publication:2202884
DOI10.1007/s12095-019-00412-3zbMath1446.94189OpenAlexW2989391174WikidataQ126836956 ScholiaQ126836956MaRDI QIDQ2202884
Publication date: 30 September 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-019-00412-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Boolean functions (94D10)
Related Items
Cites Work
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- Nonlinearities of S-boxes
- How to build robust shared control systems
- Linear codes from simplicial complexes
- A coding theory construction of new systematic authentication codes
- Minimal linear codes over finite fields
- Binary linear codes from vectorial Boolean functions and their weight distribution
- 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\)
- 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
- Perfect nonlinear S-boxes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Association schemes and coding theory
- Minimal Linear Codes in Odd Characteristic
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
