{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:36Z","timestamp":1742914236295,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"258-270","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Monotone Encodings"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rani","family":"Hod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Mathematics\u00a058(2), 191\u2013193 (1986)","journal-title":"Discrete Mathematics"},{"issue":"8","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.ejc.2006.05.001","volume":"27","author":"N. Alon","year":"2006","unstructured":"Alon, N., Asodi, V.: Tracing a single user. European Journal of Combinatorics\u00a027(8), 1227\u20131234 (2006)","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/TIT.2006.887089","volume":"53","author":"N. Alon","year":"2007","unstructured":"Alon, N., Asodi, V.: Tracing many users with almost no rate penalty. IEEE Transactions on Information Theory\u00a053(1), 437\u2013439 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the 34th Annual ACM STOC, pp. 659\u2013668 (2002)","DOI":"10.1145\/509907.510003"},{"issue":"1","key":"22_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.37236\/1377","volume":"5","author":"D. Coppersmith","year":"1998","unstructured":"Coppersmith, D., Shearer, J.: New bounds for union-free families of sets. Electronic Journal of Combinatorics\u00a05(1), 39 (1998)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1606","DOI":"10.1109\/TIT.2005.844097","volume":"51","author":"M. Cs\u0171r\u00f6s","year":"2005","unstructured":"Cs\u0171r\u00f6s, M., Ruszink\u00f3, M.: Single user tracing and disjointly superimposed codes. IEEE Transactions on Information Theory\u00a051(4), 1606\u20131611 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"22_CR7","first-page":"158","volume":"18","author":"A.G. Dyachkov","year":"1982","unstructured":"Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii\u00a018(3), 158\u2013166 (1982)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"1-2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u0151s","year":"1985","unstructured":"Erd\u0151s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of\u00a0r others. Israel Journal of Mathematics\u00a051(1-2), 79\u201389 (1985)","journal-title":"Israel Journal of Mathematics"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z. F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: A note on r-cover-free families. Journal of Combinatorial Theory Series A\u00a073(1), 172\u2013173 (1996)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: Proceedings of the 22nd IEEE CCC, pp. 96\u2013108 (2007)","DOI":"10.1109\/CCC.2007.38"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J. Koml\u00f3s","year":"1985","unstructured":"Koml\u00f3s, J., Greenberg, A.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory\u00a031(2), 302\u2013306 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Laczay, B., Ruszink\u00f3, M.: Multiple user tracing codes. In: Proceedings of IEEE ISIT 2006, pp. 1900\u20131904 (2006)","DOI":"10.1109\/ISIT.2006.261811"},{"key":"22_CR13","first-page":"19","volume":"183","author":"D.W. Masser","year":"1990","unstructured":"Masser, D.W.: Note on a conjecture of Szpiro. Ast\u00e9risque\u00a0183, 19\u201323 (1990)","journal-title":"Ast\u00e9risque"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-73420-8_28","volume-title":"Automata, Languages and Programming","author":"T. Moran","year":"2007","unstructured":"Moran, T., Naor, M., Segev, G.: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 303\u2013315. Springer, Heidelberg (2007)"},{"key":"22_CR15","first-page":"165","volume":"161\/162","author":"J. Oesterl\u00e9","year":"1988","unstructured":"Oesterl\u00e9, J.: Nouvelles approches du \u201cth\u00e9or\u00e8me\u201d de Fermat. Ast\u00e9risque\u00a0161\/162, 165\u2013186 (1988)","journal-title":"Ast\u00e9risque"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M. Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the r-cover-free families. Journal of Combinatorial Theory Series\u00a0A\u00a066(2), 302\u2013310 (1994)","journal-title":"Journal of Combinatorial Theory Series\u00a0A"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:26:01Z","timestamp":1714620361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}