1. Kautz, W.H. and Singleton, R.C., Nonrandom Binary Superimposed Codes, IEEE Trans. Inform. Theory, 1964, vol. 10, no. 4, pp. 363–377.
2. D’yachkov, A.G. and Rykov, V.V., Bounds on the Length of Disjunctive Codes, Probl. Peredachi Inf., 1982, vol. 18, no. 3, pp. 7–13 [Probl. Inf. Trans. (Engl. Transl.), 1982, vol. 18, no. 3, pp. 166–171].
3. D’yachkov, A.G., Vorob’ev, I.V., Polyansky, N.A., and Shchukin, V.Yu., Bounds on the Rate of Disjunctive Codes, Probl. Peredachi Inf., 2014, vol. 50, no. 1, pp. 31–63 [Probl. Inf. Trans. (Engl. Transl.), 2014, vol. 50, no. 1, pp. 27–56].
4. Mitchell, C.J. and Piper, F.C., Key Storage in Secure Networks, Discrete Appl. Math., 1988, vol. 21, no. 3, pp. 215–228.
5. Sidelnikov, V.M. and Prikhodov, O.Yu., On the Construction of (w, r) Cover-Free Codes, Probl. Peredachi Inf., 2009, vol. 45, no. 1, pp. 36–40 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 1, pp. 32–36].