Secret sharing schemes from three classes of linear codes
From MaRDI portal
Publication:3547868
DOI10.1109/TIT.2005.860412zbMath1283.94105OpenAlexW2120756519MaRDI QIDQ3547868
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.860412
Related Items
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, Three-weight ternary linear codes from a family of power functions, Weight distributions for projective binary linear codes from Weil sums, 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, Three classes of linear codes with two or three weights, Linear codes with two or three weights from quadratic bent functions, The fullrank value function, Several classes of binary linear codes and their weight enumerators, Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\), New classes of binary few weight codes from trace codes over a chain ring, Two classes of two-weight linear codes, The geometric structure of relative one-weight codes, Two classes of linear codes and their weight distributions, Minimal linear codes constructed from 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, Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\), On the weight distribution of some minimal codes, Constructions of projective linear codes by the intersection and difference of sets, Complete weight enumerators of three classes of linear codes, Five classes of optimal two-weight linear codes, Binary linear codes from vectorial Boolean functions and their weight distribution, Linear codes from simplicial complexes, Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\), A construction of \(q\)-ary linear codes with two weights, Complete weight enumerators of a class of three-weight linear codes, A class of three-weight and five-weight linear codes, Linear codes with few weights from cyclotomic classes and weakly regular bent functions, Some hypersurfaces over finite fields, minimal codes and secret sharing schemes, A construction of \(q\)-ary linear codes with irreducible cyclic codes, New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications], Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\), Complete weight enumerators of a class of linear codes with two weights, Complete weight enumerator for a class of linear codes from defining sets and their applications, Secret sharing schemes from binary linear codes, Two-weight and three-weight linear codes based on Weil sums, Minimal linear codes from Maiorana-McFarland functions, Three-weight cyclic codes and their weight distributions, 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, On a kind of two-weight code, A family of distance-optimal minimal linear codes with flexible parameters, Notes on generalized Hamming weights of some classes of binary codes, Optimal minimal linear codes from posets, The weight distribution of a class of \(p\)-ary cyclic codes and their applications, Some two-weight and three-weight linear codes, Linear codes with few weights from weakly regular plateaued functions, Complete weight enumerators for several classes of two-weight and three-weight linear codes, A link between combinatorial designs and three-weight linear codes, Projective binary linear codes from special Boolean functions, 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, Complete weight enumerators of some linear codes from quadratic forms, 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, A class of linear codes with two weights or three weights from some planar functions, Four classes of linear codes from cyclotomic cosets, Optimal binary codes from trace codes over a non-chain ring, A kind of three-weight linear codes, Linear codes from quadratic forms, Weight enumerators of a class of linear codes, Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\), Evaluation of the Hamming weights of a class of linear codes based on Gauss sums, At most three-weight binary linear codes from generalized Moisio's exponential sums, A construction of \(p\)-ary linear codes with two or three weights, Complete weight enumerators of a class of linear codes over finite fields, Construction of minimal linear codes from multi-variable functions, On some classes of codes with a few weights, Weight distributions and weight hierarchies of two classes of binary linear codes, Two classes of binary cyclic codes and their weight distributions, Complete weight enumerators of two classes of linear codes with a few weights, 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, 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, Minimal linear codes over finite fields, Hamming weight distributions of multi-twisted codes over finite fields, A family of projective two-weight linear codes, Binary linear codes with few weights from Boolean functions, A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme, Complete weight enumerators of a class of two-weight linear codes, A family of linear codes from constant dimension subspace codes, Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes, A geometric characterization of minimal codes and their asymptotic performance, New classes of \(p\)-ary few weight codes, Complete weight enumerators of a class of linear codes with two or three weights, Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets], Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\), On relative constant-weight codes, Two-weight or three-weight binary linear codes from cyclotomic mappings, Infinite families of optimal linear codes and their applications to distributed storage systems, A class of cyclic codes from two distinct finite fields, Trellis complexity and pseudoredundancy of relative two-weight codes, Unnamed Item, 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, Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map], The subfield and extended codes of a subclass of optimal three-weight cyclic codes, Octanary linear codes using simplicial complexes, On the subfield codes of a subclass of optimal cyclic codes and their covering structures, Generalized Hamming weights of linear codes from cryptographic functions, Optimal binary linear codes from posets of the disjoint union of two chains, Minimal codewords arising from the incidence of points and hyperplanes in projective spaces, Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications, Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\), Five-weight codes from three-valued correlation of M-sequences, Further projective binary linear codes derived from two-to-one functions and their duals, Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\), Two new classes of projective two-weight linear codes, Complete weight enumerators of two classes of linear codes, Characterization of some minimal codes for secret sharing, RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS, Multisecret-sharing schemes and bounded distance decoding of linear codes, Unnamed Item, Complete weight enumerators of a class of linear codes, Secret Sharing Schemes from Linear Codes overFp + vFp
