Linear codes with few weights from weakly regular bent functions based on a generic construction
From MaRDI portal
Publication:502405
DOI10.1007/s12095-016-0186-5zbMath1351.94079OpenAlexW2342371336MaRDI QIDQ502405
Publication date: 5 January 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-016-0186-5
linear codesweight distributionbent functionscyclotomic fieldssecret sharing schemesvectorial functions\(p\)-ary codes\(p\)-ary functionsweakly regular bent functions
Related Items
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Secret sharing schemes based on the dual of Golay codes ⋮ Minimal linear codes from weakly regular bent functions ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ A survey on the applications of Niho exponents ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Two classes of linear codes and their weight distributions ⋮ A survey on \(p\)-ary and generalized bent functions ⋮ Minimal linear codes constructed from functions ⋮ Constructions of projective linear codes by the intersection and difference of sets ⋮ A construction of \(q\)-ary linear codes with irreducible cyclic codes ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ Construction of minimal linear codes with few weights from weakly regular plateaued functions ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Generalized Hamming weights of linear codes from cryptographic functions ⋮ Some shortened codes from linear codes constructed by defining sets ⋮ Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues ⋮ Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Some subfield codes from MDS codes ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ On generalized hyper-bent functions ⋮ A family of distance-optimal minimal linear codes with flexible parameters ⋮ Four decades of research on bent functions ⋮ Optimal minimal linear codes from posets ⋮ Minimal linear codes from weakly regular plateaued balanced functions ⋮ Linear codes from weakly regular plateaued functions and their secret sharing schemes ⋮ The subfield codes of hyperoval and conic codes ⋮ Projective binary linear codes from special Boolean functions ⋮ A construction of codes with linearity from two linear codes ⋮ A class of linear codes with a few weights ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ Linear codes from vectorial Boolean power functions ⋮ Linear codes with few weights from inhomogeneous quadratic functions ⋮ A construction of \(p\)-ary linear codes with two or three weights ⋮ Recent results and problems on constructions of linear codes from cryptographic functions ⋮ Two families of subfield codes with a few weights ⋮ Binary linear codes with few weights from Boolean functions ⋮ New linear codes with few weights derived from Kloosterman sums ⋮ Characterization of \(p\)-ary functions in terms of association schemes and its applications ⋮ A geometric characterization of minimal codes and their asymptotic performance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Yet another variation on minimal linear codes
- The weight distribution of a class of \(p\)-ary cyclic codes
- On triple-sum-sets and two or three weights codes
- Three-weight cyclic codes and their weight distributions
- Four decades of research on bent functions
- Generalized bent functions and their properties
- On ``bent functions
- How to build robust shared control systems
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- A coding theory construction of new systematic authentication codes
- Some new classes of cyclic codes with three or six weights
- A class of three-weight cyclic codes
- On Minimal and Quasi-minimal Linear Codes
- Bent functions and their connections to combinatorics
- Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
- 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
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Variations on Minimal Linear Codes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Secret sharing schemes from three classes of linear codes
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- The Geometry of Two-Weight Codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- Almost Asymptotic Regulation of Markovian Jumping Linear Systems in Discrete Time
- New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
- Bent Functions
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
