{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:22:48Z","timestamp":1648815768201},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0166-218x(99)00196-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:44:34Z","timestamp":1027647874000},"page":"231-245","source":"Crossref","is-referenced-by-count":2,"title":["A scheme for the synchronization of variable length codes"],"prefix":"10.1016","volume":"101","author":[{"given":"S.","family":"Perkins","sequence":"first","affiliation":[]},{"given":"D.H.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(99)00196-1_BIB1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/18.651064","article-title":"Binary Huffman equivalent codes with a short synchronizing codeword","volume":"44","author":"Escott","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/S0166-218X(99)00196-1_BIB2","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","article-title":"Self-synchronizing Huffman codes","volume":"30","author":"Ferguson","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0166-218X(99)00196-1_BIB3","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/18.490560","article-title":"Extended synchronizing codewords for binary prefix codes","volume":"42","author":"Lam","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0166-218X(99)00196-1_BIB4","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TIT.1985.1057110","article-title":"Error recovery for variable length codes","volume":"31","author":"Maxted","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(99)00196-1_BIB5","unstructured":"M. Nelson, The Data Compression Book. M & T Publishing, North America, Prentice-Hall International (UK) Ltd, England, 1991."},{"issue":"4","key":"10.1016\/S0166-218X(99)00196-1_BIB6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TIT.1971.1054657","article-title":"Construction of minimum-redundancy codes with an optimum synchronizing property","volume":"17","author":"Rudner","year":"1971","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(99)00196-1_BIB7","unstructured":"J.J. Stiffler, Theory of Synchronous Communications, Prentice-Hall, Englewood Cliffs, NJ, 1971."},{"key":"10.1016\/S0166-218X(99)00196-1_BIB8","unstructured":"O.D.J. Thomas, D.H. Smith, A. Ryley, Synchronized lossless data compression for DDS tape storage, in: K.A.S. Immink, A.J. Han Vinck (Eds.), Proceedings of the 1995 International Symposium on Synchronization, Saalbau, Germany 1995, pp. 12\u201315."},{"key":"10.1016\/S0166-218X(99)00196-1_BIB9","first-page":"547","article-title":"An Adaptive error-tolerant and lossless data compressor for DDS","volume":"23","author":"Thomas","year":"1997","journal-title":"J. Inform. Recording"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001961?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001961?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T11:24:21Z","timestamp":1555327461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0166218X99001961"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00196-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}