{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:26:18Z","timestamp":1775017578010,"version":"3.50.1"},"reference-count":25,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1134\/s0032946022040056","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T12:06:06Z","timestamp":1673352366000},"page":"341-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory"],"prefix":"10.1134","volume":"58","author":[{"given":"A.","family":"Janabekova","sequence":"first","affiliation":[]},{"given":"G. A.","family":"Kabatiansky","sequence":"additional","affiliation":[]},{"given":"I.","family":"Kamel","sequence":"additional","affiliation":[]},{"given":"T. F.","family":"Rabie","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"issue":"7","key":"5064_CR1","doi-asserted-by":"publisher","first-page":"4843","DOI":"10.1109\/TIT.2011.2146130","volume":"57","author":"M. Cheng","year":"2011","unstructured":"Cheng, M. and Miao, Y., On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting, IEEE Trans. Inform. Theory, 2011, vol.\u00a057, no.\u00a07, pp.\u00a04843\u20134851. https:\/\/doi.org\/10.1109\/TIT.2011.2146130","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5064_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1134\/S003294602102006X","volume":"57","author":"E.E. Egorova","year":"2021","unstructured":"Egorova, E.E., and Kabatiansky, G.A., Separable Collusion-Secure Multimedia Codes, Probl. Peredachi Inf., 2021, vol.\u00a057, no.\u00a02, pp.\u00a090\u2013111 [Probl. Inf. Transm. (Engl. Transl.), 2021, vol.\u00a057, no.\u00a02, pp.\u00a0178\u2013198]. https:\/\/doi.org\/10.1134\/S003294602102006X","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"5064_CR3","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","unstructured":"Boneh, D. and Shaw, J., Collusion-Secure Fingerprinting for Digital Data, IEEE Trans. Inform. Theory, 1998, vol.\u00a044, no.\u00a05, pp.\u00a01897\u20131905. https:\/\/doi.org\/10.1109\/18.705568","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5064_CR4","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A. Barg","year":"2003","unstructured":"Barg, A., Blakley, G.R., and Kabatiansky, G.A., Digital Fingerprinting Codes: Problem Statements, Constructions, Identification of Traitors, IEEE Trans. Inform. Theory, 2003, vol.\u00a049, no.\u00a04, pp.\u00a0852\u2013865. https:\/\/doi.org\/10.1109\/TIT.2003.809570","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5064_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1112\/jlms\/s1-16.4.212","volume":"16","author":"P. Erd\u0151s","year":"1941","unstructured":"Erd\u0151s, P. and Tur\u00e1n, P., On a Problem of Sidon in Additive Number Theory, and on Some Related Problems, J.\u00a0London Math. Soc., 1941, vol.\u00a016, no.\u00a04, pp.\u00a0212\u2013215. https:\/\/doi.org\/10.1112\/jlms\/s1-16.4.212","journal-title":"J. London Math. Soc."},{"issue":"2","key":"5064_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0195-6698(85)80001-9","volume":"6","author":"L. Babai","year":"1985","unstructured":"Babai, L. and S\u00f3s, V.T., Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs, European J. Combin., 1985, vol.\u00a06, no.\u00a02, pp.\u00a0101\u2013114. https:\/\/doi.org\/10.1016\/S0195-6698(85)80001-9","journal-title":"European J. Combin."},{"issue":"1","key":"5064_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/jcta.2000.3127","volume":"94","author":"G. Cohen","year":"2001","unstructured":"Cohen, G., Litsyn, S., and Z\u00e9mor, G., Binary B2-Sequences: A New Upper Bound, J.\u00a0Combin. Theory Ser.\u00a0A, 2001, vol.\u00a094, no.\u00a01, pp.\u00a0152\u2013155. https:\/\/doi.org\/10.1006\/jcta.2000.3127","journal-title":"J. Combin. Theory Ser. A"},{"key":"5064_CR8","unstructured":"Gy\u00f6rfi, L., Gy\u0151ri, S., Laczay, B., and Ruszink\u00f3, M., Lectures on Multiple Access Channels, book draft, 2005. Available at http:\/\/www.szit.bme.hu\/~gyori\/AFOSR_05\/book.pdf"},{"issue":"1","key":"5064_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S0032946018010040","volume":"54","author":"G.A. Kabatiansky","year":"2018","unstructured":"Kabatiansky, G.A. and Lebedev, V.S., On Metric Dimension of Nonbinary Hamming Spaces, Probl. Peredachi Inf., 2018, vol.\u00a054, no.\u00a01, pp.\u00a054\u201362 [Probl. Inf. Transm. (Engl. Transl.), 2018, vol.\u00a054, no.\u00a01, pp.\u00a048\u201355]. https:\/\/doi.org\/10.1134\/S0032946018010040","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5064_CR10","first-page":"26","volume":"17","author":"A.G. D\u2019yachkov","year":"1981","unstructured":"D\u2019yachkov, A.G. and Rykov, V.V., On a Coding Model for a Multiple-Access Adder Channel, Probl. Peredachi Inf., 1981, vol.\u00a017, no.\u00a02, pp.\u00a026\u201338 [Probl. Inf. Transm. (Engl. Transl.), 1981, vol.\u00a017, no.\u00a02, pp.\u00a094\u2013104]. http:\/\/mi.mathnet.ru\/eng\/ppi1390","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5064_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"31","author":"J.K. Wolf","year":"1985","unstructured":"Wolf, J.K., Born Again Group Testing: Multiaccess Communications, IEEE Trans. Inform. Theory, 1985, vol.\u00a031, no.\u00a02, pp.\u00a0185\u2013191. https:\/\/doi.org\/10.1109\/TIT.1985.1057026","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1\u20132","key":"5064_CR12","first-page":"229","volume":"8","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P. and R\u00e9nyi, A., On Two Problems of Information Theory, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl., 1963, vol.\u00a08, no.\u00a01\u20132, pp.\u00a0229\u2013243. Available at http:\/\/static.renyi.hu\/renyi_cikkek\/1963_on_two_problems_of_information_theory.pdf","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"issue":"1\u20132","key":"5064_CR13","first-page":"195","volume":"9","author":"B. Lindstr\u00f6m","year":"1964","unstructured":"Lindstr\u00f6m, B., On a Combinatory Detection Problem. I, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl., 1964, vol.\u00a09, no.\u00a01\u20132, pp.\u00a0195\u2013207.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"5064_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4153\/CJM-1966-007-2","volume":"18","author":"D.G. Cantor","year":"1966","unstructured":"Cantor, D.G. and Mills, W.H., Determination of a Subset from Certain Combinatorial Properties, Canad. J. Math., 1966, vol.\u00a018, pp.\u00a042\u201348. https:\/\/doi.org\/10.4153\/CJM-1966-007-2","journal-title":"Canad. J. Math."},{"key":"5064_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcta.2019.01.002","volume":"165","author":"Z. Jiang","year":"2019","unstructured":"Jiang, Z. and Polyanskii, N., On the Metric Dimension of Cartesian Powers of a Graph, J.\u00a0Combin. Theory Ser.\u00a0A, 2019, vol.\u00a0165, pp.\u00a01\u201314. https:\/\/doi.org\/10.1016\/j.jcta.2019.01.002","journal-title":"J. Combin. Theory Ser. A"},{"key":"5064_CR16","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H. and Mazzawi, H., On Parity Check $$(0,1)$$-Matrix over $$\\mathbb{Z}_p$$, in Proc. 22nd Annu. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA\u201911), San Francisco, CA, Jan.\u00a023\u201325, 2011, pp.\u00a01383\u20131394. https:\/\/dl.acm.org\/doi\/10.5555\/2133036.2133142","DOI":"10.1137\/1.9781611973082.106"},{"issue":"1","key":"5064_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/TIT.2020.3033445","volume":"67","author":"J. Fan","year":"2021","unstructured":"Fan, J., Gu, Y., Hachimori, M., and Miao, Y., Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting, IEEE Trans. Inform. Theory, 2021, vol.\u00a067, no.\u00a01, pp.\u00a0200\u2013216. https:\/\/doi.org\/10.1109\/TIT.2020.3033445","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5064_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1134\/S0032946020040080","volume":"56","author":"E.E. Egorova","year":"2020","unstructured":"Egorova, E.E., Fernandez, M., Kabatiansky, G.A., and Miao, Y., Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise, Probl. Peredachi Inf., 2020, vol.\u00a056, no.\u00a04, pp.\u00a097\u2013108 [Probl. Inf. Transm. (Engl. Transl.), 2000, vol.\u00a056, no.\u00a04, pp.\u00a0388\u2013398]. https:\/\/doi.org\/10.1134\/S0032946020040080","journal-title":"Probl. Peredachi Inf."},{"key":"5064_CR19","doi-asserted-by":"publisher","unstructured":"Vorobyev, I., Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate, Des. Codes Cryptogr., 2022, Open Access Article. https:\/\/doi.org\/10.1007\/s10623-022-01144-x","DOI":"10.1007\/s10623-022-01144-x"},{"key":"5064_CR20","doi-asserted-by":"publisher","unstructured":"Gkagkos, M., Pradhan, A.K., Amalladinne, V., Narayanan, K., Chamberland, J-F., and Georghiades, C.N., Approximate Support Recovery Using Codes for Unsourced Multiple Access, in Proc. 2021 IEEE Int. Symp. on Information Theory (ISIT\u20192021), Melbourne, Australia, July 12\u201320, 2021, pp.\u00a02948\u20132953. https:\/\/doi.org\/10.1109\/ISIT45174.2021.9517995","DOI":"10.1109\/ISIT45174.2021.9517995"},{"issue":"4","key":"5064_CR21","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho, D.L., Compressed Sensing, IEEE Trans. Inform. Theory, 2006, vol.\u00a052, no.\u00a04, pp.\u00a01289\u20131306. https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"5064_CR22","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J. and Tao, T., Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?, IEEE Trans. Inform. Theory, 2006, vol.\u00a052, no.\u00a012, pp.\u00a05406\u20135425. https:\/\/doi.org\/10.1109\/TIT.2006.885507","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"5064_CR23","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., and Tao, T., Stable Signal Recovery from Incomplete and Inaccurate Measurements, Comm. Pure Appl. Math., 2006, vol.\u00a059, no.\u00a08, pp.\u00a01207\u20131223. https:\/\/doi.org\/10.1002\/cpa.20124","journal-title":"Comm. Pure Appl. Math."},{"issue":"6","key":"5064_CR24","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1109\/TSP.2016.2634550","volume":"65","author":"J. Wen","year":"2017","unstructured":"Wen, J., Zhou, Z., Wang, J., Tang, X., and Mo, Q., A Sharp Condition for Exact Support Recovery with Orthogonal Matching Pursuit, IEEE Trans. Signal Process., 2017, vol.\u00a065, no.\u00a06, pp.\u00a01370\u20131382. https:\/\/doi.org\/10.1109\/TSP.2016.2634550","journal-title":"IEEE Trans. Signal Process."},{"key":"5064_CR25","doi-asserted-by":"publisher","unstructured":"Mehrabi, M. and Tchamkerten, A., Error-Correction for Sparse Support Recovery Algorithms, in Proc. 2021 IEEE Int. Symp. on Information Theory (ISIT\u20192021), Melbourne, Australia, July 12\u201320, 2021, pp.\u00a01754\u20131759. https:\/\/doi.org\/10.1109\/ISIT45174.2021.9518027","DOI":"10.1109\/ISIT45174.2021.9518027"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946022040056","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:46:32Z","timestamp":1775011592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946022040056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["5064"],"URL":"https:\/\/doi.org\/10.1134\/s0032946022040056","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292322040052","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"1 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}