{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:23:57Z","timestamp":1775053437255,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875252","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"2341-2345","source":"Crossref","is-referenced-by-count":8,"title":["Bounds on the rate of superimposed codes"],"prefix":"10.1109","author":[{"given":"A. G.","family":"D'yachkov","sequence":"first","affiliation":[]},{"given":"I.V.","family":"Vorobyev","sequence":"additional","affiliation":[]},{"given":"N.A.","family":"Polyanskii","sequence":"additional","affiliation":[]},{"given":"V.Yu.","family":"Shchukin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"112","author":"d'yachkov","year":"2003","journal-title":"Lectures on Designing Screening Experiments"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57576-1_8"},{"key":"18","first-page":"141","article-title":"Random coding bounds on the rate for list-decoding superimposed codes","volume":"19","author":"rashad","year":"1990","journal-title":"Problems of Control and Inform Theory"},{"key":"15","first-page":"228","article-title":"On constructions of list-decoding superimposed codes","author":"vilenkin","year":"1998","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"16","first-page":"126","article-title":"New results in the theory of superimposed codes","author":"d'yachkov","year":"2000","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"13","first-page":"95","article-title":"Upper bounds on the rate of superimposed -codes based on engel's inequality","author":"d'yachkov","year":"2002","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"14","first-page":"223","article-title":"Bounds on constant weight binary superimposed codes","volume":"17","author":"nguyen","year":"1988","journal-title":"Problems of Control and Inform Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/B:PRIT.0000011270.09033.8f"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300002121"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.37236\/1377","article-title":"New bounds for union-free families of sets","volume":"5","author":"copperersmith","year":"1998","journal-title":"The Electronic Journal of Combinatorics"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0195"},{"key":"2","first-page":"229","article-title":"A survey of superimposed code theory","volume":"12","author":"d'yachkov","year":"1983","journal-title":"Problems of Control and Inform Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90068-6"},{"key":"10","first-page":"185","article-title":"Some tables for (w, r)-superimposed codes","author":"lebedev","year":"2002","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"7","first-page":"166","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"d'yachkov","year":"1982","journal-title":"Problems of Information Transmission"},{"key":"6","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"d'yachkov","year":"1989","journal-title":"Problems of Control and Inform Theory"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6048-4_22"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.817530"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1999.3036"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2002.3257"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875252.pdf?arnumber=6875252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T14:39:30Z","timestamp":1602686370000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875252","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}