新结果和应用的叠加代码(和相关的组合结构)，以设计有效的组测试程序

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI:10.1109/ISIT.2004.1365291

Annalisa De Bonis, U. Vaccaro

{"title":"新结果和应用的叠加代码(和相关的组合结构)，以设计有效的组测试程序","authors":"Annalisa De Bonis, U. Vaccaro","doi":"10.1109/ISIT.2004.1365291","DOIUrl":null,"url":null,"abstract":"Let s be the number of unknown positive elements in a population of n members, 2/spl les/s<n. We aim at finding all the s positive elements by testing group of members of the population, under the constraint that a group tests positive if and only if it contains exactly one positive element. This model was considered in [T. Berger et al., 1984, P. Damaschke, 1998]. We provide tight upper and lower bounds on the optimal number of tests needed to solve above group testing problem, improving on [A.G. Dyachkov, 2003]. Instrumental to our results are new and improved bounds for generalized superimposed codes in the sense of [A. De Bonis et al., 2003, A.G. Dyachkov et al., 1984].","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures\",\"authors\":\"Annalisa De Bonis, U. Vaccaro\",\"doi\":\"10.1109/ISIT.2004.1365291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let s be the number of unknown positive elements in a population of n members, 2/spl les/s<n. We aim at finding all the s positive elements by testing group of members of the population, under the constraint that a group tests positive if and only if it contains exactly one positive element. This model was considered in [T. Berger et al., 1984, P. Damaschke, 1998]. We provide tight upper and lower bounds on the optimal number of tests needed to solve above group testing problem, improving on [A.G. Dyachkov, 2003]. Instrumental to our results are new and improved bounds for generalized superimposed codes in the sense of [A. De Bonis et al., 2003, A.G. Dyachkov et al., 1984].\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}