1. D’yachkov, A.G., Vorobyev, I.V., Polyanskii, N.A., and Shchukin, V.Yu., Almost Disjunctive List-Decoding Codes (Two Talks), in Proc. 14th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-14), Svetlogorsk, Russia, Sept. 7–13, 2014, pp. 115–126.
2. Kautz, W.H. and Singleton, R.C., Nonrandom Binary Superimposed Codes, IEEE Trans. Inform. Theory, 1964, vol. 10, no. 4, pp. 363–377.
3. D’yachkov, A.G. and Rykov, V.V., On One Application of Codes for a Multiple Access Channel in the ALOHA System, in Proc. VI All-Union School-Seminar on Computer Networks, Moscow-Vinnitsa, 1981, Part 4, pp. 18–24.
4. 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].
5. Erdős, P., Frankl, F., and Füredi, F., Families of Finite Sets in Which No Set Is Covered by the Union of Two Others, J. Combin. Theory, Ser. A, 1982, vol. 33, no. 2, pp. 158–166.