How to build robust shared control systems
From MaRDI portal
Publication:1273533
DOI10.1023/A:1026421315292zbMath0919.94012OpenAlexW1550528471MaRDI QIDQ1273533
Ross Anderson, Torleiv Kløve, Cunsheng Ding, Tor Helleseth
Publication date: 26 August 1999
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026421315292
Related Items (44)
A construction of linear codes and strongly regular graphs from \(q\)-polynomials ⋮ 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 construction of binary linear codes from Boolean functions ⋮ Linear codes from a generic construction ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ Two classes of linear codes and their weight distributions ⋮ The dimension and minimum distance of two classes of primitive BCH codes ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ A construction of \(q\)-ary linear codes with two weights ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent 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 linear codes with few weights over finite fields ⋮ Secret sharing schemes from binary linear codes ⋮ The punctured codes of two classes of cyclic codes with few weights ⋮ Optimal binary linear codes from posets of the disjoint union of two chains ⋮ Quantum codes from trace codes ⋮ 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 ⋮ Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums ⋮ Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\) ⋮ A note on the minimal binary linear code ⋮ Notes on generalized Hamming weights of some classes of binary codes ⋮ The optimal linear secret sharing scheme for any given access structure ⋮ The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures ⋮ Projective binary linear codes from special Boolean functions ⋮ More constructions of 3-weight 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 ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ A kind of three-weight linear codes ⋮ 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 ⋮ Constructions of several classes of linear codes with a few weights ⋮ On some classes of codes with a few weights ⋮ Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ Binary linear codes with few weights from Boolean functions ⋮ New linear codes with few weights derived from Kloosterman sums ⋮ Secret-sharing with a class of ternary codes ⋮ Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\) ⋮ Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\) ⋮ Two-weight or three-weight binary linear codes from cyclotomic mappings
This page was built for publication: How to build robust shared control systems
