{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:08Z","timestamp":1740148928757,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-10-LABX-07-01"],"award-info":[{"award-number":["ANR-10-LABX-07-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011697","name":"R\u00e9gion Bretagne","doi-asserted-by":"publisher","award":["ARED 9582 InterCOR"],"award-info":[{"award-number":["ARED 9582 InterCOR"]}],"id":[{"id":"10.13039\/501100011697","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s12243-020-00805-z","type":"journal-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T04:02:25Z","timestamp":1603080145000},"page":"623-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Excess rate for model selection in interactive compression using belief propagation decoding"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2808-3859","authenticated-orcid":false,"given":"Navid Mahmoudian","family":"Bidgoli","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Maugey","sequence":"additional","affiliation":[]},{"given":"Aline","family":"Roumy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"805_CR1","doi-asserted-by":"crossref","unstructured":"Roumy A., Maugey T. (2015) Universal lossless coding with random user access: the cost of interactivity. In: 2015 IEEE International Conference on Image Processing (ICIP), pp 1870\u20131874","DOI":"10.1109\/ICIP.2015.7351125"},{"key":"805_CR2","doi-asserted-by":"publisher","first-page":"100845","DOI":"10.1016\/j.phycom.2019.100845","volume":"37","author":"E Dupraz","year":"2019","unstructured":"Dupraz E., Roumy A., Maugey T., Kieffer M. (2019) Rate-storage regions for extractable source coding with side information. Physical Communication 37:100845","journal-title":"Physical Communication"},{"key":"805_CR3","unstructured":"Mahmoudian Bidgoli N., Maugey T., Roumy A. (2019) Compression de contenus 360 et transmission adapt\u00e9e \u00e1 la navigation de l\u2019utilisateur. In: Actes de la 27\u00e9me \u00e9dition du colloque Gretsi"},{"key":"805_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TSIPN.2020.2981263","volume":"6","author":"T Maugey","year":"2020","unstructured":"Maugey T., Roumy A., Dupraz E., Kieffer M. (2020) Incremental coding for extractable compression in the context of massive random access. IEEE Transactions on Signal and Information Processing over Networks 6:251\u2013260","journal-title":"IEEE Transactions on Signal and Information Processing over Networks"},{"key":"805_CR5","doi-asserted-by":"crossref","unstructured":"Draper S.C., Martinian E. (2007) Compound conditional source coding, slepian-wolf list decoding, and applications to media coding. In: 2007 IEEE International Symposium on Information Theory, pp 1511\u20131515","DOI":"10.1109\/ISIT.2007.4557436"},{"issue":"9","key":"805_CR6","doi-asserted-by":"publisher","first-page":"4006","DOI":"10.1109\/TIT.2009.2025527","volume":"55","author":"J Chen","year":"2009","unstructured":"Chen J., He D., Jagmohan A. (2009) On the duality between Slepian\u2013Wolf coding and channel coding under mismatched decoding. IEEE Trans Inf Theory 55(9):4006\u20134018","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"805_CR7","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1109\/18.340469","volume":"40","author":"N Merhav","year":"1994","unstructured":"Merhav N., Kaplan G., Lapidoth A., Shamai Shitz S. (1994) On information rates for mismatched decoders. IEEE Trans Inf Theory 40(6):1953\u20131967","journal-title":"IEEE Trans Inf Theory"},{"issue":"7","key":"805_CR8","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1109\/18.887846","volume":"46","author":"A Ganti","year":"2000","unstructured":"Ganti A., Lapidoth A., Telatar I.E. (2000) Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit. IEEE Trans Inf Theory 46(7):2315\u20132328","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"805_CR9","doi-asserted-by":"publisher","first-page":"2647","DOI":"10.1109\/TIT.2014.2310453","volume":"60","author":"J Scarlett","year":"2014","unstructured":"Scarlett J., Martinez A., i. Fabregas A.G. (2014) Mismatched decoding: error exponents, second-order rates and saddlepoint approximations. IEEE Trans Inf Theory 60(5):2647\u20132666","journal-title":"IEEE Trans Inf Theory"},{"key":"805_CR10","doi-asserted-by":"crossref","unstructured":"Mahmoudian Bidgoli N., Maugey T., Roumy A., Nasiri F., Payan F. (2019) A geometry-aware compression of 3d mesh texture with random access. In: 2019 Picture Coding Symposium (PCS), pp 1\u20135","DOI":"10.1109\/PCS48520.2019.8954519"},{"key":"805_CR11","unstructured":"Han T.S., Kobayashi K. (2002) Mathematics of information and coding. Translations of mathematical monographs, Providence, R.I. : American Mathematical Society, 203"},{"issue":"4","key":"805_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1561\/0100000004","volume":"1","author":"I Csiszar","year":"2004","unstructured":"Csiszar I., Shields P.C. (2004) Information theory and statistics: a tutorial. Foundations and Trends in Communications and Information Theory 1(4):417\u2013528. Publisher: Now Publishers, Inc.","journal-title":"Foundations and Trends in Communications and Information Theory"},{"issue":"5","key":"805_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J. (1978) Modeling by shortest data description. Automatica 14(5):465\u2013471","journal-title":"Automatica"},{"key":"805_CR14","doi-asserted-by":"crossref","unstructured":"Gruenwald P.D. (2007) The minimum description length principle. MIT Press","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"805_CR15","unstructured":"Dupraz E., Maugey T., Roumy A., Kieffer M. (August 2017) Transmission and storage rates for sequential massive random access. arXiv:1612.07163 [cs, math]"},{"key":"805_CR16","unstructured":"Cover T.M., Thomas J.A. (2006) Elements of information theory (wiley series in telecommunications and signal processing). Wiley-Interscience, USA"},{"key":"805_CR17","doi-asserted-by":"crossref","unstructured":"Bidgoli N.M., Maugey T., Roumy A. (2017) Correlation model selection for interactive video communication. In: 2017 IEEE International Conference on Image Processing (ICIP), pp 2184\u20132188","DOI":"10.1109\/ICIP.2017.8296669"},{"issue":"2","key":"805_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"GD Forney","year":"2001","unstructured":"Sae-Young Chung, Forney G.D., Richardson T.J., Urbanke R. (2001) On the design of low-density parity-check codes within 0.0045 db of the shannon limit. IEEE Commun Lett 5(2):58\u201360","journal-title":"IEEE Commun Lett"},{"issue":"8","key":"805_CR19","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1109\/TIT.2004.831778","volume":"50","author":"A Roumy","year":"2004","unstructured":"Roumy A., Guemghar S., Caire G., Verdu S. (2004) Design methods for irregular repeat-accumulate codes. IEEE Trans Inf Theory 50(8):1711\u20131727","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"805_CR20","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson T.J., Shokrollahi M.A., Urbanke R.L. (2001) Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inf Theory 47(2):619\u2013637","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"805_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TIT.1974.1055171","volume":"20","author":"A Wyner","year":"1974","unstructured":"Wyner A. (1974) Recent results in the shannon theory. IEEE Trans Inf Theory 20(1):2\u201310","journal-title":"IEEE Trans Inf Theory"},{"key":"805_CR22","doi-asserted-by":"crossref","unstructured":"Chen J., He D., Yang E. (2007) On the codebook-level duality between slepian-wolf coding and channel coding. In: 2007 Information Theory and Applications Workshop, pp 84\u201393","DOI":"10.1109\/ITA.2007.4357566"},{"key":"805_CR23","doi-asserted-by":"crossref","unstructured":"Wang L., Kim Y. (2015) Linear code duality between channel coding and slepian-wolf coding. In: 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp 147\u2013152","DOI":"10.1109\/ALLERTON.2015.7446997"},{"issue":"10","key":"805_CR24","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/LCOMM.2002.804244","volume":"6","author":"AD Liveris","year":"2002","unstructured":"Liveris A.D., Zixiang Xiong, Georghiades C.N. (2002) Compression of binary sources with side information at the decoder using ldpc codes. IEEE Commun Lett 6(10):440\u2013442","journal-title":"IEEE Commun Lett"},{"key":"805_CR25","doi-asserted-by":"crossref","unstructured":"Westerlaken R.P., Borchert S., Gunnewiek R.K., Lagendijk R.L. (2007) Analyzing symbol and bit plane-based ldpc in distributed video coding. In: 2007 IEEE International Conference on Image Processing, 2, pp II\u201317\u2013II\u201320","DOI":"10.1109\/ICIP.2007.4379081"},{"issue":"1","key":"805_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager R. (1962) Low-density parity-check codes. IRE Transactions on Information Theory 8 (1):21\u201328","journal-title":"IRE Transactions on Information Theory"},{"key":"805_CR27","doi-asserted-by":"crossref","unstructured":"Richardson T.J., Urbanke R.L. (2008) Modern coding theory, Cambridge Univ Press","DOI":"10.1017\/CBO9780511791338"},{"issue":"10","key":"805_CR28","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"S ten Brink","year":"2001","unstructured":"ten Brink S. (2001) Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans Commun 49(10):1727\u20131737","journal-title":"IEEE Trans Commun"},{"key":"805_CR29","doi-asserted-by":"crossref","unstructured":"Ryan W., Lin S. (2009) Channel codes: classical and modern, Cambridge University Press","DOI":"10.1017\/CBO9780511803253"},{"issue":"3","key":"805_CR30","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1561\/0100000013","volume":"3","author":"I Land","year":"2006","unstructured":"Land I., Huber J. (2006nov) Information combining. Found. Trends Commun. Inf. Theory 3 (3):227\u2013330","journal-title":"Found. Trends Commun. Inf. Theory"},{"issue":"11","key":"805_CR31","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1109\/TIT.2004.836693","volume":"50","author":"A Ashikhmin","year":"2004","unstructured":"Ashikhmin A., Kramer G., ten Brink S. (2004) Extrinsic information transfer functions: model and erasure channel properties. IEEE Trans Inf Theory 50(11):2657\u20132673","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"805_CR32","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/TCOMM.2004.826370","volume":"52","author":"S ten Brink","year":"2004","unstructured":"ten Brink S., Kramer G., Ashikhmin A. (2004) Design of low-density parity-check codes for modulation and detection. IEEE Trans Commun 52(4):670\u2013678","journal-title":"IEEE Trans Commun"},{"issue":"2","key":"805_CR33","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TCOMM.2010.02.090034","volume":"58","author":"Z Sun","year":"2010","unstructured":"Sun Z., Tian C., Chen J., Wong K.M. (2010) Ldpc code design for asynchronous slepian-wolf coding. IEEE Trans Commun 58(2):511\u2013520","journal-title":"IEEE Trans Commun"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-020-00805-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-020-00805-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-020-00805-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T07:06:50Z","timestamp":1634627210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-020-00805-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":33,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["805"],"URL":"https:\/\/doi.org\/10.1007\/s12243-020-00805-z","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"11 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}