# A simple construction of cover-free (s, ℓ)-code with certain constant weight

@article{Dyachkov2016ASC, title={A simple construction of cover-free (s, ℓ)-code with certain constant weight}, author={Arkadii G. D'yachkov and Ilya Vorobyev and Nikita Polyanskii and Vladislav Shchukin}, journal={ArXiv}, year={2016}, volume={abs/1605.06847} }

We give a method of constructing a cover-free $(s, \ell)$-code. For $k > s$, our construction yields a $ {{n \choose s} \choose \ell}\times {n \choose k}$ cover-free $(s, \ell)$-code with a constant column weight.

## References

SHOWING 1-3 OF 3 REFERENCES

A simple construction of d-disjunct matrices with certain constant weights

- MathematicsDiscret. Math.
- 1996

Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others

- Computer ScienceJ. Comb. Theory, Ser. A
- 2002

This paper considers a generalization of the superimposed code concept called a binary superimposed ( s,l )-code which is identified by the incidence matrix of a family defined in the title, and discusses the constructions based on MDS-codes.

On key storage in secure networks

- Computer Science, MathematicsJournal of Cryptology
- 2004

Improved bounds on the storage requirements of systems where the keys for encrypting messages are derived from the pairwise intersections of sets of private keys issued to the users are given.