How to build robust shared control systems
From MaRDI portal
Recommendations
Cited in
(62)- More constructions of 3-weight linear codes
- Projective binary linear codes from special Boolean functions
- 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-weight or three-weight binary linear codes from cyclotomic mappings
- Two classes of optimal p-ary few-weight codes from down-sets
- The optimal linear secret sharing scheme for any given access structure
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- A construction of q-ary linear codes with two weights
- Constructions of several classes of linear codes with a few weights
- A note on the minimal binary linear code
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Five-Lee-weight linear codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Binary linear codes from vectorial Boolean functions and their weight distribution
- 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
- A construction of binary linear codes from Boolean functions
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- A family of linear codes with few weights and their subfield codes
- Linear codes from a generic construction
- Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\)
- Linear codes from arcs and quadrics
- New classes of binary few weight codes from trace codes over a chain ring
- Quantum codes from trace codes
- Notes on generalized Hamming weights of some classes of binary codes
- Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map
- The dimension and minimum distance of two classes of primitive BCH codes
- Constructing few-weight linear codes and strongly regular graphs
- A tight upper bound on the number of nonzero weights of a quasi-cyclic code
- Linear codes with few weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- On some classes of codes with a few weights
- Binary linear codes with few weights from Boolean functions
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Binary linear codes with at most three weights from cyclotomic mappings
- The punctured codes of two classes of cyclic codes with few weights
- Secret sharing schemes from binary linear codes
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
- Two classes of linear codes and their weight distributions
- Linear codes with few weights over finite fields
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- Several classes of linear codes with few weights from the closed butterfly structure
- A new family of minimal linear codes from simplicial complexes
- Two families of \(\mathbb{Z}_{p^m}\)-linear codes and their applications
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- Secret-sharing with a class of ternary codes
- A class of three-weight linear codes over finite fields of odd characteristic
- The weight distributions of several classes of few-weight linear codes
- A class of linear codes with a few weights
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Binary linear codes with two or three weights from Niho exponents
- Several classes of optimal linear codes with few weights from simplicial complexes
- A class of ternary codes with few weights
- A kind of three-weight linear codes
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- On binomial Weil sums and an application
- Optimal binary linear codes from posets of the disjoint union of two chains
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Further designs for self-orthogonal and LCD codes developed from functions over finite fields
- Several classes of linear codes with few weights derived from Weil sums
- New linear codes with few weights derived from Kloosterman sums
This page was built for publication: How to build robust shared control systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273533)
