{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T04:43:08Z","timestamp":1781844188426,"version":"3.54.5"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"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":[[2024,9]]},"DOI":"10.1134\/s0032946024030049","type":"journal-article","created":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T09:03:10Z","timestamp":1736067790000},"page":"199-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method"],"prefix":"10.1134","volume":"60","author":[{"given":"I. A.","family":"Melnikov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. Yu.","family":"Uglovskii","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. A.","family":"Kreshchuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. A.","family":"Kureev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. M.","family":"Khorov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"137","published-online":{"date-parts":[[2025,1,5]]},"reference":[{"issue":"4","key":"5101_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1134\/S0032946023040014","volume":"59","author":"A.Yu. Uglovskii","year":"2023","unstructured":"Uglovskii, A.Yu., Melnikov, I.A., Alexeev, I.A., and Kureev, A.A., Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution, Probl. Inf. Transm., 2023, vol.\u00a059, no.\u00a04, pp.\u00a0217\u2013224. https:\/\/doi.org\/10.1134\/S0032946023040014","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"5101_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R.G. Gallager","year":"1962","unstructured":"Gallager, R.G., Low-Density Parity-Check Codes, IRE Trans. Inform. Theory, 1962, vol.\u00a08, no.\u00a01, pp.\u00a021\u201328. https:\/\/doi.org\/10.1109\/TIT.1962.1057683","journal-title":"IRE Trans. Inform. Theory"},{"issue":"5","key":"5101_CR3","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"M.P.C. Fossorier","year":"1999","unstructured":"Fossorier, M.P.C., Mihaljevic, M., and Imai, H., Reduced Complexity Iterative Decoding of Low-Density Parity Check Codes Based on Belief Propagation, IEEE Trans. Commun., 1999, vol.\u00a047, no.\u00a05, pp.\u00a0673\u2013680. https:\/\/doi.org\/10.1109\/26.768759","journal-title":"IEEE Trans. Commun."},{"key":"5101_CR4","doi-asserted-by":"publisher","first-page":"4054","DOI":"10.1109\/ACCESS.2018.2797694","volume":"6","author":"J. Lewandowsky","year":"2018","unstructured":"Lewandowsky, J. and Bauch, G., Information-Optimum LDPC Decoders Based on the Information Bottleneck Method, IEEE Access, 2018, vol.\u00a06, pp.\u00a04054\u20134071. https:\/\/doi.org\/10.1109\/ACCESS.2018.2797694","journal-title":"IEEE Access"},{"issue":"7","key":"5101_CR5","doi-asserted-by":"publisher","DOI":"10.3390\/e24070972","volume":"24","author":"J. Lewandowsky","year":"2022","unstructured":"Lewandowsky, J., Bauch, G., and Stark, M., Information Bottleneck Signal Processing and Learning to Maximize Relevant Information for Communication Receivers, Entropy, 2022, vol.\u00a024, no.\u00a07, Paper No.\u00a0972 (30\u00a0pp.). https:\/\/doi.org\/10.3390\/e24070972","journal-title":"Entropy"},{"issue":"10","key":"5101_CR6","doi-asserted-by":"publisher","DOI":"10.3390\/app8101884","volume":"8","author":"M. Stark","year":"2018","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G., Information-Bottleneck Decoding of High-Rate Irregular LDPC Codes for Optical Communication Using Message Alignment, Appl. Sci., 2018, vol.\u00a08, no.\u00a010, Paper No.\u00a01884 (17\u00a0pp.). https:\/\/doi.org\/10.3390\/app8101884","journal-title":"Appl. Sci."},{"key":"5101_CR7","doi-asserted-by":"crossref","unstructured":"Kurkoski, B.M., Yamaguchi, K., and Kobayashi, K., Noise Thresholds for Discrete LDPC Decoding Mappings, in Proc. 2008 IEEE Global Telecommunications Conf. (GLOBECOM\u201908), New Orleans, LA, USA, Nov. 30 \u2013 Dec. 4, 2008, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/GLOCOM.2008.ECP.214","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"issue":"3","key":"5101_CR8","first-page":"19","volume":"60","author":"I.A. Melnikov","year":"2024","unstructured":"Melnikov, I.A., Uglovskii, A.Yu., Kreshchuk, A.A., Kureev, A.A., and Khorov, E.M., Using the Information Bottleneck Method to Reduce the Complexity of LDPC Decoders, Probl. Peredachi Inf., 2024, vol.\u00a060, no.\u00a03, pp.\u00a019\u201325. https:\/\/doi.org\/10.31857\/S0555292324030033","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"5101_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol.\u00a027, no.\u00a05, pp.\u00a0533\u2013547. https:\/\/doi.org\/10.1109\/TIT.1981.1056404","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"5101_CR10","doi-asserted-by":"publisher","first-page":"4076","DOI":"10.1109\/TIT.2007.907507","volume":"53","author":"E. Sharon","year":"2007","unstructured":"Sharon, E., Litsyn, S., and Goldberger, J., Efficient Serial Message-Passing Schedules for LDPC Decoding, IEEE Trans. Inform. Theory, 2007, vol.\u00a053, no.\u00a011, pp.\u00a04076\u20134091. https:\/\/doi.org\/10.1109\/TIT.2007.907507","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5101_CR11","doi-asserted-by":"crossref","unstructured":"Chang, Y.-M., Casado, A.I.V., Chang, M.-C.F., and Wesel, R.D., Lower-Complexity Layered Belief-Propagation Decoding of LDPC Codes, in Proc. IEEE Int. Conf. on Communications (ICC\u201908), Beijing, China, May 19\u201323, 2008, pp.\u00a01155\u20131160. https:\/\/doi.org\/10.1109\/ICC.2008.225","DOI":"10.1109\/ICC.2008.225"},{"issue":"1\u20132","key":"5101_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11265-008-0221-7","volume":"53","author":"M. Karkooti","year":"2008","unstructured":"Karkooti, M., Radosavljevic, P., and Cavallaro, J.R., Configurable LDPC Decoder Architectures for Regular and Irregular Codes, J.\u00a0Sign. Process. Syst., 2008, vol.\u00a053, no.\u00a01\u20132, pp.\u00a073\u201388. https:\/\/doi.org\/10.1007\/s11265-008-0221-7","journal-title":"J. Sign. Process. Syst."},{"key":"5101_CR13","doi-asserted-by":"crossref","unstructured":"Meidlinger, M., Balatsoukas-Stimming, A., Burg, A., and Matz, G., Quantized Message Passing for LDPC Codes, in Conf. Record: 49th Asilomar Conf. on Signals, Systems & Computers, Pacific Grove, CA, USA, Nov. 8\u201311, 2015, pp.\u00a01606\u20131610. https:\/\/doi.org\/10.1109\/ACSSC.2015.7421419","DOI":"10.1109\/ACSSC.2015.7421419"},{"issue":"1","key":"5101_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1134\/S0032946023010027","volume":"59","author":"M. Fernandez","year":"2023","unstructured":"Fernandez, M., Kabatiansky, G.A., Kruglik, S.A., and Miao, Y., Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding, Probl. Inf. Transm., 2023, vol.\u00a059, no.\u00a01, pp.\u00a014\u201321. https:\/\/doi.org\/10.1134\/S0032946023010027","journal-title":"Probl. Inf. Transm."},{"issue":"6","key":"5101_CR15","doi-asserted-by":"publisher","first-page":"3638","DOI":"10.1109\/TCOMM.2021.3062838","volume":"69","author":"X. He","year":"2021","unstructured":"He, X., Cai, K., Song, W., and Mei, Z., Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels, IEEE Trans. Commun., 2021, vol.\u00a069, no.\u00a06, pp.\u00a03638\u20133651. https:\/\/doi.org\/10.1109\/TCOMM.2021.3062838","journal-title":"IEEE Trans. Commun."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024030049.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946024030049","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024030049.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:55:03Z","timestamp":1775012103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946024030049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["5101"],"URL":"https:\/\/doi.org\/10.1134\/s0032946024030049","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"20 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}