Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
From MaRDI portal
Publication:3546656
DOI10.1109/TIT.2005.847722zbMath1192.94114OpenAlexW2123695891MaRDI QIDQ3546656
Claude Carlet, Jin Yuan, Cunsheng Ding
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.847722
Related Items (only showing first 100 items - show all)
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 ⋮ 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 ⋮ Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ Two classes of optimal \(p\)-ary few-weight codes from down-sets ⋮ A class of five-weight cyclic codes and their weight distribution ⋮ Several classes of optimal ternary cyclic codes with minimal distance four ⋮ 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 ⋮ A construction of binary linear codes from Boolean functions ⋮ Linear codes from a generic construction ⋮ Optimal \(p\)-ary cyclic codes with minimum distance four from monomials ⋮ On the minimum distance of negacyclic codes with two zeros ⋮ Two classes of cyclic codes and their weight enumerator ⋮ A class of cyclic codes whose duals have five zeros ⋮ Linear codes with two or three weights from quadratic bent functions ⋮ The fullrank value function ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ Three-weight minimal linear codes ⋮ On the intersection of binary linear codes ⋮ A note on almost difference sets in nonabelian groups ⋮ Two classes of linear codes and their weight distributions ⋮ Minimal linear codes constructed from functions ⋮ Three-weight linear codes from Weil sums ⋮ New classes of permutation binomials and permutation trinomials over finite fields ⋮ Five classes of optimal two-weight linear codes ⋮ Linear codes from simplicial complexes ⋮ 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 ⋮ On the relationships between perfect nonlinear functions and universal hash families ⋮ Low-degree planar monomials in characteristic two ⋮ Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) ⋮ Optimal ternary cyclic codes with minimum distance four and five ⋮ Secret sharing schemes from binary linear codes ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ The weight distribution of a class of \(p\)-ary cyclic codes ⋮ A class of optimal ternary cyclic codes and their duals ⋮ Three-weight cyclic codes and their weight distributions ⋮ On a generalization of planar functions ⋮ 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 ⋮ Notes on generalized Hamming weights of some classes of binary codes ⋮ Almost perfect and planar functions ⋮ 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 ⋮ Planar functions over fields of characteristic two ⋮ On perfect nonlinear functions \((\Pi)\) ⋮ Complete weight enumerators for several classes of two-weight and three-weight linear codes ⋮ Further results on optimal ternary cyclic codes ⋮ New pseudo-planar binomials in characteristic two and related schemes ⋮ A class of six-weight cyclic codes and their weight distribution ⋮ More constructions of 3-weight linear codes ⋮ A construction of codes with linearity from two linear codes ⋮ Linear codes with few weights from weakly regular bent functions based on a generic construction ⋮ A class of linear codes with a few weights ⋮ A class of three-weight linear codes and their complete weight enumerators ⋮ Complete weight enumerators of some linear codes from quadratic forms ⋮ Three classes of binary linear codes with good parameters ⋮ New classes of optimal ternary cyclic codes with minimum distance four ⋮ A kind of three-weight linear codes ⋮ On the nonlinearity of S-boxes and linear codes ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ Linear codes from quadratic forms ⋮ Linear codes with few weights from inhomogeneous quadratic functions ⋮ Evaluation of the Hamming weights of a class of linear codes based on Gauss sums ⋮ Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\) ⋮ 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 ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ On some classes of codes with a few weights ⋮ 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 ⋮ Three-weight ternary linear codes from a family of cyclic difference sets ⋮ The weight distributions of two classes of \(p\)-ary cyclic codes with 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 ⋮ 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 ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ Binary linear codes with few weights from Boolean functions ⋮ Some results on the differential functions over finite fields ⋮ A note on cyclic codes from APN 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 ⋮ The Hamming distances of repeated-root cyclic codes of length \(5 p^s\) ⋮ Two-weight or three-weight binary linear codes from cyclotomic mappings ⋮ Exceptional planar polynomials
This page was built for publication: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
