{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:47:29Z","timestamp":1781016449855,"version":"3.54.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1109\/tcomm.2022.3173002","type":"journal-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T19:53:58Z","timestamp":1651780438000},"page":"4417-4428","source":"Crossref","is-referenced-by-count":1,"title":["Context-Tree-Based Lossy Compression and Its Application to CSI Representation"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1131-2790","authenticated-orcid":false,"given":"Henrique K.","family":"Miyamoto","sequence":"first","affiliation":[{"name":"Laboratory of Signals and Systems (L2S), CentraleSupélec, Paris-Saclay University, Gif-sur-Yvette, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0643-0445","authenticated-orcid":false,"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[{"name":"Laboratory of Signals and Systems (L2S), CentraleSupélec, Paris-Saclay University, Gif-sur-Yvette, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"24","article-title":"A CSI compression scheme using context trees","volume-title":"Proc. Int. Zurich Seminar Inf. Commun. (IZS)","author":"Miyamoto"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046225"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2818160"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2968430"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3043502"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925902"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/e23010104"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96262-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/0100000004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref14","first-page":"128","article-title":"Context tree weighting: Multi-alphabet sources","volume-title":"Proc. 14th Symp. Inf. Theory","author":"Tjalkens"},{"key":"ref15","first-page":"230","article-title":"Sequential weighting algorithms for multi-alphabet sources","volume-title":"Proc. 6th Joint Swedish-Russian Int. Workshop Inf. Theory","author":"Tjalkens"},{"key":"ref16","first-page":"259","article-title":"Multi-alphabet universal coding using a binary decomposition context tree weighting algorithm","volume-title":"Proc. 15th Symp. Inf. Theory Benelux","author":"Tjalkens"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1491"},{"issue":"13","key":"ref18","first-page":"379","article-title":"Superior guarantees for sequential prediction and lossless compression via alphabet decomposition","volume":"7","author":"Begleiter","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","first-page":"TP6-7","article-title":"Context-tree maximizing","volume-title":"Proc. 34th Annu. Conf. Inf. Sci. Syst.","author":"Willems"},{"key":"ref20","first-page":"335","article-title":"Maximum a posteriori probability tree models","volume-title":"Proc. 4th Int. ITG Conf. Source Channel Coding","author":"Willems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2018.8445994"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12511"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/290159.290162"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1997.582140"},{"key":"ref28","article-title":"Weighting techniques in data compression: Theory and algorithms","author":"Volf","year":"2002"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01340.x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1155\/S1025583400000084"},{"key":"ref31","volume-title":"MATLAB LTE Toolbox","year":"2020"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9830596\/09770048.pdf?arnumber=9770048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:55:26Z","timestamp":1705964126000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9770048\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":30,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2022.3173002","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}