{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:05:56Z","timestamp":1649077556914},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p> In this paper we present new results on sequential and parallel construction of optimal and almost-optimal length-restricted prefix-free codes. We show that length-restricted prefix-free codes with error 1\/n<jats:sup>k<\/jats:sup> for any k &gt; 0 can be constructed in O(n log n) time, or in O( log n) time with n CREW processors. A length-restricted code with error 1\/n<jats:sup>k<\/jats:sup> for any k \u2264 L\/ log <jats:sub>\u03a6<\/jats:sub> n, where [Formula: see text], can be constructed in O( log n) time with n\/ log n CREW processors. We also describe an algorithm for the construction of optimal length-restricted codes with maximum codeword length L that works in O(L) time with n CREW processors. <\/jats:p>","DOI":"10.1142\/s0129626406002484","type":"journal-article","created":{"date-parts":[[2006,3,24]],"date-time":"2006-03-24T11:18:03Z","timestamp":1143199083000},"page":"81-92","source":"Crossref","is-referenced-by-count":1,"title":["ALGORITHMS FOR CONSTRUCTION OF OPTIMAL AND ALMOST-OPTIMAL LENGTH-RESTRICTED CODES"],"prefix":"10.1142","volume":"16","author":[{"given":"MAREK","family":"KARPINSKI","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, University of Bonn, Germany"}]},{"given":"YAKOV","family":"NEKRICH","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, University of Bonn, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574380"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90207-P"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/0203008"},{"key":"rf6","first-page":"41","volume":"16","author":"G\u00fcttler R.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"rf8","first-page":"172","author":"Kirkpatrick D.","journal-title":"Algorithmica"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/0216070"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79150"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792233245"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056250"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:16:36Z","timestamp":1565108196000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1142\/S0129626406002484"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002484","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}