Pages that link to "Item:Q1273533"
From MaRDI portal
The following pages link to How to build robust shared control systems (Q1273533):
Displaying 46 items.
- A construction of binary linear codes from Boolean functions (Q297928) (← links)
- Linear codes from a generic construction (Q301633) (← links)
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures (Q477568) (← links)
- Linear codes with few weights from weakly regular bent functions based on a generic construction (Q502405) (← links)
- A class of linear codes with a few weights (Q502407) (← links)
- A kind of three-weight linear codes (Q507948) (← links)
- Secret sharing schemes from binary linear codes (Q621578) (← links)
- Two classes of optimal \(p\)-ary few-weight codes from down-sets (Q827599) (← links)
- Secret-sharing with a class of ternary codes (Q1583097) (← links)
- Two classes of linear codes and their weight distributions (Q1647743) (← links)
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums (Q1696137) (← links)
- Binary linear codes with two or three weights from Niho exponents (Q1696138) (← links)
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\) (Q1755989) (← links)
- On some classes of codes with a few weights (Q1783733) (← links)
- Projective binary linear codes from special Boolean functions (Q1983338) (← links)
- More constructions of 3-weight linear codes (Q1983404) (← links)
- At most three-weight binary linear codes from generalized Moisio's exponential sums (Q1999908) (← links)
- Constructions of several classes of linear codes with a few weights (Q2005691) (← links)
- Binary linear codes with few weights from Boolean functions (Q2043421) (← links)
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\) (Q2089272) (← links)
- Two-weight or three-weight binary linear codes from cyclotomic mappings (Q2101179) (← links)
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image (Q2123296) (← links)
- New classes of binary few weight codes from trace codes over a chain ring (Q2142555) (← links)
- A note on the minimal binary linear code (Q2202884) (← links)
- Notes on generalized Hamming weights of some classes of binary codes (Q2202905) (← links)
- Several classes of linear codes with few weights from the closed butterfly structure (Q2238931) (← links)
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions (Q2291661) (← links)
- New linear codes with few weights derived from Kloosterman sums (Q2302568) (← links)
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\) (Q2334438) (← links)
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials (Q2359969) (← links)
- The dimension and minimum distance of two classes of primitive BCH codes (Q2396760) (← links)
- Binary linear codes from vectorial Boolean functions and their weight distribution (Q2404399) (← links)
- A construction of \(q\)-ary linear codes with two weights (Q2406672) (← links)
- Complete weight enumerator for a class of linear codes from defining sets and their applications (Q2419763) (← links)
- The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
- Constructing few-weight linear codes and strongly regular graphs (Q2675859) (← links)
- Constructions of linear codes with two or three weights from vectorial dual-bent functions (Q6041565) (← links)
- Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map (Q6056737) (← links)
- Several classes of linear codes with few weights over finite fields (Q6063257) (← links)
- The punctured codes of two classes of cyclic codes with few weights (Q6112188) (← links)
- Optimal binary linear codes from posets of the disjoint union of two chains (Q6112206) (← links)
- Quantum codes from trace codes (Q6138307) (← links)
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums (Q6159448) (← links)
- A class of three-weight linear codes over finite fields of odd characteristic (Q6489326) (← links)
- Linear codes with few weights over finite fields (Q6631500) (← links)
- The weight distributions of several classes of few-weight linear codes (Q6646788) (← links)
