{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:50:10Z","timestamp":1725540610590},"reference-count":0,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2002.1000003","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:26:17Z","timestamp":1056558377000},"page":"460","source":"Crossref","is-referenced-by-count":1,"title":["Using multiple Huffman code tables for optimal coding of DCT blocks"],"prefix":"10.1109","author":[{"given":"G.","family":"Lakhani","sequence":"first","affiliation":[]}],"member":"263","event":{"name":"DCC 2002. Data Compression Conference","acronym":"DCC-02","location":"Snowbird, UT, USA"},"container-title":["Proceedings DCC 2002. Data Compression Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7840\/21578\/01000003.pdf?arnumber=1000003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T18:21:08Z","timestamp":1489170068000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1000003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1109\/dcc.2002.1000003","relation":{},"subject":[]}}