Binary linear codes from vectorial Boolean functions and their weight distribution
From MaRDI portal
Publication:2404399
DOI10.1016/j.disc.2017.07.008zbMath1403.94113arXiv1612.04456OpenAlexW2579163092MaRDI QIDQ2404399
Deng Tang, Claude Carlet, Zhengchun Zhou
Publication date: 18 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.04456
linear codeauthentication codevectorial Boolean functionsecret sharing schemeextended Walsh spectrum
Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62) Boolean functions (94D10)
Related Items
Minimal binary linear codes: a general framework based on bent concatenation ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ A note on the minimal binary linear code ⋮ The subfield codes of hyperoval and conic codes ⋮ Recent results and problems on constructions of linear codes from cryptographic functions ⋮ Binary linear codes with few weights from Boolean functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Bent vectorial functions and linear codes from o-polynomials
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- Three-weight cyclic codes and their weight distributions
- On ``bent functions
- How to build robust shared control systems
- A coding theory construction of new systematic authentication codes
- Partially-bent functions
- The dimension and minimum distance of two classes of primitive BCH codes
- Three classes of linear codes with two or three weights
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- How to share a secret
- A class of low-rate nonlinear binary codes
- Decomposing bent functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- A Generic Construction of Cartesian Authentication Codes
- The Automorphism Groups of the Kerdock Codes
- Perfect nonlinear S-boxes
- Fundamentals of Error-Correcting Codes
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Association schemes and coding theory
- Vectorial Bent Functions From Multiple Terms Trace Functions
- Kloosterman sums and finite field extensions
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
