{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:10:51Z","timestamp":1755839451707,"version":"3.37.3"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965875","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"606-611","source":"Crossref","is-referenced-by-count":3,"title":["Linear Computation Coding Inspired by the Lempel-Ziv Algorithm"],"prefix":"10.1109","author":[{"given":"Ralf","family":"Muller","sequence":"first","affiliation":[{"name":"Friedrich-Alexander Universität Erlangen-Nürnberg,Institute for Digital Communications,Erlangen,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414317"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414317"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.028"},{"key":"ref6","article-title":"Apparatus and method for computing a matrix vector product of a certain matrix and a vector","author":"m\u00fcller","year":"2022","journal-title":"European Patent Application No 22185178 5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"ref5","article-title":"Most resource efficient matrix vector multiplication on reconfigurable hardware","author":"lehnert","year":"2022","journal-title":"IEEE Access"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240234"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/a15070253"},{"key":"ref2","article-title":"Finite resolution decomposition of a matrix for low-complexity and energy-efficient matrix-vector multiplication","author":"m\u00fcller","year":"0","journal-title":"2020 European Patent Application No 20154407 9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222693"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244952"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965875.pdf?arnumber=9965875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:05Z","timestamp":1672083725000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965875","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}