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 minimum distance of negacyclic codes with two zeros
- A note on almost difference sets in nonabelian groups
- Two classes of linear codes and their weight distributions
- Five classes of optimal two-weight linear codes
- Linear codes from simplicial complexes
- Optimal codes from Fibonacci polynomials and secret sharing schemes
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Binary linear codes with two or three weights from Niho exponents
- A sequence construction of cyclic codes over finite fields
- The weight distribution of a class of \(p\)-ary cyclic codes and their applications
- Some two-weight and three-weight linear codes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- New constructions of systematic authentication codes from three classes of cyclic codes
- On some classes of codes with a few weights
- Three-weight ternary linear codes from a family of cyclic difference sets
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Minimal linear codes over finite fields
- Extended framework for constructing (complete) permutations by specifying their coordinate functions
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Further results on optimal ternary cyclic codes
- More constructions of 3-weight linear codes
- New classes of optimal ternary cyclic codes with minimum distance four
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Infinite families of 2-designs and 3-designs from linear codes
- Some new classes of cyclic codes with three or six weights
- A construction of p-ary linear codes with two or three weights
- The differential spectrum of a class of power functions over finite fields
- Dembowski-Ostrom polynomials and reversed Dickson polynomials
- Two classes of binary cyclic codes and their weight distributions
- Complete weight enumerators of two classes of linear codes with a few weights
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Recent results and problems on constructions of linear codes from cryptographic functions
- Combinatorial \(t\)-designs from special functions
- Hamming weight distributions of multi-twisted codes over finite fields
- Binary linear codes with few weights from Boolean functions
- The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph
- Characterization of \(p\)-ary functions in terms of association schemes and its applications
- A geometric characterization of minimal codes and their asymptotic performance
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- An inductive construction of minimal codes
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Secret sharing schemes based on the dual of Golay codes
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- A family of optimal ternary cyclic codes with minimum distance five and their duals
- Differential and boomerang spectrums of some power permutations
- Minimal binary linear codes: a general framework based on bent concatenation
- New classes of binary few weight codes from trace codes over a chain ring
- Three-weight minimal linear codes
- Minimal linear codes constructed from functions
- Three-weight linear codes from Weil sums
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Minimal linear codes from Maiorana-McFarland functions
- On a generalization of planar functions
- Notes on generalized Hamming weights of some classes of binary codes
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular plateaued balanced functions
- Linear codes with few weights from weakly regular plateaued functions
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Several classes of linear codes with few weights from the closed butterfly structure
- Further results on permutation polynomials over finite fields
- Some planar monomials in characteristic 2
- On the constructions of constant-composition codes from perfect nonlinear functions
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- New linear codes with few weights derived from Kloosterman sums
- A family of planar binomials in characteristic 2
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- Low-degree planar polynomials over finite fields of characteristic two
- Complete weight enumerators of a class of linear codes with two or three weights
- On an open problem about a class of optimal ternary cyclic codes
- On relative constant-weight codes
- A class of cyclic codes from two distinct finite fields
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Three-weight ternary linear codes from a family of power functions
- The dimension and minimum distance of two classes of primitive BCH codes
- A construction of several classes of two-weight and three-weight linear codes
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A construction of q-ary linear codes with two weights
- A construction of q-ary linear codes with irreducible cyclic codes
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions
- Two-weight and three-weight linear codes based on Weil sums
- A class of three-weight cyclic codes
- Sets of zero-difference balanced functions and their applications
- Perfect nonlinear functions and cryptography
- Weight distributions of a class of cyclic codes from \(\mathbb F_l\)-conjugates
- Exceptional planar polynomials
- A survey on the applications of Niho exponents
- Two classes of two-weight linear codes
- On the weight distribution of some minimal codes
- Further study of planar functions in characteristic two
- Two families of optimal ternary cyclic codes with minimal distance four
- A class of binary cyclic codes with optimal parameters
- Constructing few-weight linear codes and strongly regular graphs
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Image sets of perfectly nonlinear maps
- A new class of distance-optimal binary cyclic codes and their duals
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)
