{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:57:41Z","timestamp":1733983061627,"version":"3.30.2"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Imaging"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1077-2014(02)00113-4","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T09:28:45Z","timestamp":1047720525000},"page":"3-10","source":"Crossref","is-referenced-by-count":2,"title":["A Fast and Simple Algorithm for the Construction of Asymmetrical Reversible Variable Length Codes"],"prefix":"10.1016","volume":"9","author":[{"given":"Hsien-Wen","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1077-2014(02)00113-4_BIB1","doi-asserted-by":"crossref","unstructured":"ITU-T, Recommendation H.263: Video Coding for Low Bit Rate Communication, 1995.","DOI":"10.1049\/ic:19950938"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB2","unstructured":"ISO\/IEC 14496-2, Final Draft International Standard: Information Technology Coding of Audio-visual Objects: Visual, 1998."},{"key":"10.1016\/S1077-2014(02)00113-4_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1049\/ip-e.1984.0028","article-title":"Technical note","volume":"131","author":"Titchener","year":"1984","journal-title":"IEE Proceedings E, Computer Digital Technology"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1049\/ip-com:19960551","article-title":"Generalised T-codes","volume":"143","author":"Titchener","year":"1996","journal-title":"IEE Proceedings Communications"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB5","first-page":"2625","article-title":"Source\/channel coding using reversible self-synchronizing variable-length codes","volume":"5","author":"Hoskote","year":"2000","journal-title":"Acoustics, Speech, and Signal Processing"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB6","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1109\/18.945265","article-title":"Modified symmetrical reversible variable-length code and its theoretical bounds","volume":"47","author":"Tsai","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB7","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1109\/26.950335","article-title":"On constructing the Huffman-code-based reversible variable-length codes","volume":"49","author":"Tsai","year":"2001","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/26.380026","article-title":"Reversible variable length codes","volume":"43","author":"Takishima","year":"1995","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB9","doi-asserted-by":"crossref","first-page":"844","DOI":"10.3169\/itej1978.43.844","article-title":"Variable length code with high resynchronisation capability","volume":"8","author":"Takishima","year":"1989","journal-title":"The Journal of the Institute of Television Engineers of Japan"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB10","unstructured":"G\u00fcnther U. Matching T-codes to a source. CDMTCS Research Report No. 153, 2001."},{"key":"10.1016\/S1077-2014(02)00113-4_BIB11","unstructured":"http:\/\/www.corpus.canterbury.ac.nz\/"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB12","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proceedings of IRE"},{"key":"10.1016\/S1077-2014(02)00113-4_BIB13","unstructured":"Moret BME, Shapiro HD. Algorithms from P to NP, vol. 1. New York: Benjamin. 1991. p. 193\u20136."},{"key":"10.1016\/S1077-2014(02)00113-4_BIB14","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1109\/26.795810","article-title":"Level-compressed Huffman decoding","volume":"47","author":"Chung","year":"1999","journal-title":"IEEE Transactions on Communications"}],"container-title":["Real-Time Imaging"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1077201402001134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1077201402001134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T01:14:16Z","timestamp":1733966056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1077201402001134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1077201402001134"],"URL":"https:\/\/doi.org\/10.1016\/s1077-2014(02)00113-4","relation":{},"ISSN":["1077-2014"],"issn-type":[{"type":"print","value":"1077-2014"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}