Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes

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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

A construction of linear codes and strongly regular graphs from \(q\)-polynomials ⋮ Three-weight ternary linear codes from a family of power functions ⋮ A survey on the applications of Niho exponents ⋮ Two classes of two-weight linear codes ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ 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 ⋮ On the weight distribution of some minimal codes ⋮ Further study of planar functions in characteristic two ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ A construction of \(q\)-ary linear codes with two weights ⋮ Two families of optimal ternary cyclic codes with minimal distance four ⋮ A construction of \(q\)-ary linear codes with irreducible cyclic codes ⋮ A class of binary cyclic codes with optimal parameters ⋮ Constructing New Piecewise Differentially 4-Uniform Permutations from Known APN Functions ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Two families of few-weight codes over a finite chain ring ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ A family of cyclic codes with two zeros ⋮ Construction of minimal linear codes with few weights from weakly regular plateaued functions ⋮ Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map] ⋮ Complete weight enumerator for a class of linear codes from defining sets and their applications ⋮ Several classes of optimal \(p\)-ary cyclic codes with minimum distance four ⋮ On the Ding and Helleseth's 7th open problem about optimal ternary cyclic codes ⋮ Several classes of linear codes with few weights over finite fields ⋮ The subfield and extended codes of a subclass of optimal three-weight cyclic codes ⋮ A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions ⋮ Image sets of perfectly nonlinear maps ⋮ Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ Two-weight and three-weight linear codes based on Weil sums ⋮ Octanary linear codes using simplicial complexes ⋮ On the subfield codes of a subclass of optimal cyclic codes and their covering structures ⋮ A new class of distance-optimal binary cyclic codes and their duals ⋮ Optimal \(p\)-ary cyclic codes with two zeros ⋮ Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Generalized Hamming weights of linear codes from cryptographic functions ⋮ Several new classes of optimal ternary cyclic codes with minimum distance four ⋮ Optimal binary linear codes from posets of the disjoint union of two chains ⋮ Two classes of new optimal ternary cyclic codes ⋮ Quantum codes from trace codes ⋮ Characterizations of a class of planar functions over finite fields ⋮ Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums ⋮ Optimal quinary negacyclic codes with minimum distance four ⋮ Five-weight codes from three-valued correlation of M-sequences ⋮ Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\) ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Minimal linear codes from Hermitian varieties and quadrics ⋮ Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ A class of three-weight cyclic codes ⋮ Sets of zero-difference balanced functions and their applications ⋮ Two new classes of projective two-weight linear 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 ⋮ Some functions with low differential uniformity ⋮ 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 ⋮ A Class of Nonbinary Codes and Sequence Families ⋮ Perfect nonlinear functions and cryptography ⋮ Weight distributions of a class of cyclic codes from \(\mathbb F_l\)-conjugates ⋮ Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ Complete weight enumerators of a class of linear codes ⋮ On some conjectures about optimal ternary cyclic codes ⋮ On some conjectures about optimal ternary cyclic codes ⋮ О приближении дискретных функций линейными функциями ⋮ 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 ⋮ A novel secret sharing scheme based on minimal linear codes ⋮ 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 ⋮ Planar polynomials arising from linearized polynomials ⋮ 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

This page was built for publication: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes