Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the relationships between perfect nonlinear functions and universal hash families
- Exceptional planar polynomials
- More constructions of 3-weight linear codes
- Some planar monomials in characteristic 2
- Linear codes over \(\mathbb{Z}_{p^2}\) with few-weight from down-sets
- Several classes of linear codes with few weights over finite fields
- Two new classes of projective two-weight linear codes
- Some two-weight and three-weight linear codes
- The weight distribution of a class of \(p\)-ary cyclic codes and their applications
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Some functions with low differential uniformity
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Two classes of optimal p-ary few-weight codes from down-sets
- Planar functions over fields of characteristic two
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Some new classes of cyclic codes with three or six weights
- A construction of q-ary linear codes with two weights
- Several classes of optimal cyclic codes with three zeros
- Generalized Hamming weights of linear codes from cryptographic functions
- A Class of Nonbinary Codes and Sequence Families
- Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
- On some conjectures about optimal ternary cyclic codes
- On some conjectures about optimal ternary cyclic codes
- A class of optimal ternary cyclic codes and their duals
- Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
- Several new classes of p-ary weakly regular plateaued functions and minimal codes with several weights
- A novel secret sharing scheme based on minimal linear codes
- The weight distribution of a class of p-ary cyclic codes
- Secret sharing schemes based on the dual of Golay codes
- Further study of planar functions in characteristic two
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Quasi-perfect linear codes from planar and APN functions
- Complete weight enumerators and weight hierarchies of two classes of linear codes
- Three-weight linear codes from Weil sums
- Low-degree planar polynomials over finite fields of characteristic two
- Planar polynomials arising from linearized polynomials
- A geometric characterization of minimal codes and their asymptotic performance
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Low-degree planar monomials in characteristic two
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Five-Lee-weight linear codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Minimal linear codes constructed from partial spreads
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Characterizations of a class of planar functions over finite fields
- Linear codes with few weights from weakly regular plateaued functions
- A class of five-weight cyclic codes and their weight distribution
- Several classes of optimal ternary cyclic codes with minimal distance four
- Two-weight and three-weight linear codes based on Weil sums
- Optimal ternary cyclic codes with minimum distance four and five
- A construction of several classes of two-weight and three-weight linear codes
- Two classes of two weight threefold linear codes
- Image sets of perfectly nonlinear maps
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Investigation of the permutation and linear codes from the Welch APN function
- Constructions for several classes of few-weight linear codes and their applications
- Construction of minimal binary linear codes with dimension n+3
- A note on cyclic codes from APN functions
- Linear codes from simplicial complexes
- Two families of few-weight codes over a finite chain ring
- Three new classes of optimal quinary cyclic codes with minimum distance four
- Vectorial bent functions and linear codes from quadratic forms
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- On the constructions of constant-composition codes from perfect nonlinear functions
- A survey on the applications of Niho exponents
- A class of six-weight cyclic codes and their weight distribution
- Minimal linear codes from Maiorana-McFarland functions
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular plateaued balanced functions
- Infinite families of 2-designs and 3-designs from linear codes
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A family of optimal ternary cyclic codes with minimum distance five and their duals
- Differential and boomerang spectrums of some power permutations
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Minimal binary linear codes: a general framework based on bent concatenation
- Optimal quinary cyclic codes with three zeros
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- 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
- Minimal linear codes constructed from functions
- New classes of optimal p-ary cyclic codes with minimum distance four
- Several new classes of optimal ternary cyclic codes with two or three zeros
- A construction of binary linear codes from Boolean functions
- A note on almost difference sets in nonabelian groups
- Three-weight ternary linear codes from a family of power functions
- Optimal quinary negacyclic codes with minimum distance four
- On the minimum distance of negacyclic codes with two zeros
- Further results on optimal ternary cyclic codes
- A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions
- A construction of p-ary linear codes with two or three weights
- Distance between vectorial Boolean functions and affine analogues (following the eighth international olympiad in cryptography)
- On the approximation of discrete functions by linear functions
- Minimal linear codes over finite fields
- A family of linear codes with few weights and their subfield codes
- A family of cyclic codes with two zeros
- Linear codes from a generic construction
- Optimal p-ary cyclic codes with minimum distance four from monomials
This page was built for publication: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546656)
