Uniqueness of some optimal superimposed codes
-
Published:2007-06
Issue:2
Volume:43
Page:113-123
-
ISSN:0032-9460
-
Container-title:Problems of Information Transmission
-
language:en
-
Short-container-title:Probl Inf Transm
Author:
Hong S.,Kapralov S.,Kim H. K.,Oh D. Y.
Publisher
Pleiades Publishing Ltd
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference26 articles.
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., Lebedev, V., Vilenkin, P., and Yekhanin, S., Cover-free Families and Superimposed Codes: Constructions, Bounds, and Applications to Cryptography and Group Testing, in Proc. IEEE Int. Sympos. on Information Theory (ISIT), Washington, DC, USA, 2001, p. 117. 3. D’yachkov, A., Macula, A., and Rykov, V.V., New Constructions of Superimposed Codes, IEEE Trans. Inform. Theory, 2000, vol. 46, no. 1, pp. 284–290. 4. D’yachkov, A., Macula, A., and Rykov, V.V., New Applications and Results of Superimposed Code Theory Arising from Potentialities of Molecular Biology, Numbers, Information, and Complexity, Althöfer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M.S., Sárközy, A., Wegener, I., and Zhang, Z., Eds., Boston: Kluwer, 2000, pp. 265–282. 5. D’yachkov, A., Macula, A., Torney, V., and Vilenkin, P., Families of Finite Sets in Which No Intersection of l Sets Is Covered by the Union of s Others, J. Combin. Theory, Ser. A, 2002, vol. 99, no. 2, pp. 195–218.
|
|