{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:33:27Z","timestamp":1775018007818,"version":"3.50.1"},"reference-count":17,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023,1]]},"DOI":"10.1134\/s0032946023010027","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T07:04:20Z","timestamp":1693206260000},"page":"14-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding"],"prefix":"10.1134","volume":"59","author":[{"given":"M.","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. A.","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. A.","family":"Kruglik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"2\u20133","key":"5070_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10623-018-0551-9","volume":"87","author":"E. Egorova","year":"2019","unstructured":"Egorova, E., Fernandez, M., Kabatiansky, G., and Lee, M.H., Signature Codes for Weighted Noisy Adder Channel, Multimedia Fingerprinting and Compressed Sensing, Des. Codes Cryptogr., 2019, vol.\u00a087, no.\u00a02\u20133, pp.\u00a0455\u2013462. https:\/\/doi.org\/10.1007\/s10623-018-0551-9","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"5070_CR2","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."},{"issue":"1","key":"5070_CR3","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":"2","key":"5070_CR4","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":"4","key":"5070_CR5","first-page":"50","volume":"58","author":"A. Janabekova","year":"2022","unstructured":"Janabekova, A., Kabatiansky, G.A., Kamel, I., and Rabie, T.F., Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory, Probl. Peredachi Inf., 2022, vol.\u00a058, no.\u00a04, pp.\u00a050\u201361 [Probl. Inf. Transm. (Engl. Transl.), 2022, vol.\u00a058, no.\u00a04, pp.\u00a0341\u2013351]. https:\/\/www.mathnet.ru\/eng\/ppi2383","journal-title":"Probl. Peredachi Inf."},{"key":"5070_CR6","doi-asserted-by":"publisher","unstructured":"Fernandez, M., Kabatiansky, G., and Miao, Y., A Novel Support Recovery Algorithms and Its Applications to Multiple-Access Channels in Proc. 2022 IEEE Int. Multi-Conf. on Engineering, Computer and Information Sciences (SIBIRCON), Yekaterinburg, Russian Federation, Nov. 11\u201313, 2022, pp.\u00a0170\u2013173. https:\/\/doi.org\/10.1109\/SIBIRCON56155.2022.10017094","DOI":"10.1109\/SIBIRCON56155.2022.10017094"},{"key":"5070_CR7","doi-asserted-by":"publisher","unstructured":"Polyanskiy, Y., A Perspective on Massive Random-Access, in Proc. 2017 IEEE Int. Symp. on Information Theory (ISIT\u20192017), Aachen, Germany, June 25\u201330, 2017, pp.\u00a02523\u20132527. https:\/\/doi.org\/10.1109\/ISIT.2017.8006984","DOI":"10.1109\/ISIT.2017.8006984"},{"issue":"4","key":"5070_CR8","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":"5070_CR9","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"},{"key":"5070_CR10","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":"6","key":"5070_CR11","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":"5070_CR12","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"},{"issue":"6","key":"5070_CR13","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1109\/18.340463","volume":"40","author":"T. Ericson","year":"1994","unstructured":"Ericson, T. and Levenshtein, V.I., Superimposed Codes in the Hamming Space, IEEE Trans. Inform. Theory, 1994, vol.\u00a040, no.\u00a06, pp.\u00a01882\u20131893. https:\/\/doi.org\/10.1109\/18.340463","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5070_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1134\/S0032946015020040","volume":"51","author":"S.G. Vl\u01cedu\u0163","year":"2015","unstructured":"Vl\u01cedu\u0163, S.G., Kabatiansky, G.A., and Lomakov, V.V., On Error Correction with Errors in Both the Channel and Syndrome, Probl. Peredachi Inf., 2015, vol.\u00a051, no.\u00a02, pp.\u00a050\u201356 [Probl. Inf. Transm. (Engl. Transl.), 2015, vol.\u00a051, no.\u00a02, pp.\u00a0132\u2013138]. https:\/\/doi.org\/10.1134\/S0032946015020040","journal-title":"Probl. Peredachi Inf."},{"issue":"6, part 1","key":"5070_CR15","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M. and Spielman, D.A., Expander Codes, IEEE Trans. Inform. Theory, 1996, vol.\u00a042, no.\u00a06, part 1, pp.\u00a01710\u20131722. https:\/\/doi.org\/10.1109\/18.556667","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"5070_CR16","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D. Spielman","year":"1996","unstructured":"Spielman, D., Linear-Time Encodable and Decodable Error-Correcting Codes, IEEE Trans. Inform. Theory, 1996, vol.\u00a042, no.\u00a06, pp.\u00a01723\u20131731. https:\/\/doi.org\/10.1109\/18.556668","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5070_CR17","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s10623-022-01144-x","volume":"4","author":"I. Vorobyev","year":"2023","unstructured":"Vorobyev, I., Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate, Des. Codes Cryptogr., 2023, vol.\u00a04, no.\u00a04, pp.\u00a01183\u20131191. https:\/\/doi.org\/10.1007\/s10623-022-01144-x","journal-title":"Des. Codes Cryptogr."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946023010027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946023010027","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946023010027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:49:24Z","timestamp":1775011764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946023010027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["5070"],"URL":"https:\/\/doi.org\/10.1134\/s0032946023010027","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292323010023","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"30 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}