{"id":"https://openalex.org/W2024299963","doi":"https://doi.org/10.1142/s0129626406002484","title":"ALGORITHMS FOR CONSTRUCTION OF OPTIMAL AND ALMOST-OPTIMAL LENGTH-RESTRICTED CODES","display_name":"ALGORITHMS FOR CONSTRUCTION OF OPTIMAL AND ALMOST-OPTIMAL LENGTH-RESTRICTED CODES","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2024299963","doi":"https://doi.org/10.1142/s0129626406002484","mag":"2024299963"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626406002484","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002484","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MAREK KARPINSKI","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Germany","Dept. of Computer Science, University of Bonn, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050513868","display_name":"Yakov Nekrich","orcid":"https://orcid.org/0000-0003-3771-5088"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"YAKOV NEKRICH","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Germany","Dept. of Computer Science, University of Bonn, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany#TAB#","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108090276"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08994433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"01","first_page":"81","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.6926379203796387},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6387289762496948},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6319787502288818},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5513553023338318},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5469841361045837},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5301830172538757},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.516609251499176},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.48222291469573975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43638724088668823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4355352520942688},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41027510166168213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37918686866760254},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33560726046562195},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19247370958328247},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.18599167466163635},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12719759345054626}],"concepts":[{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.6926379203796387},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6387289762496948},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6319787502288818},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5513553023338318},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5469841361045837},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5301830172538757},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.516609251499176},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.48222291469573975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43638724088668823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4355352520942688},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41027510166168213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37918686866760254},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33560726046562195},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19247370958328247},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.18599167466163635},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12719759345054626},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626406002484","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002484","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1735088419","https://openalex.org/W2013021781","https://openalex.org/W2020600762","https://openalex.org/W2021302562","https://openalex.org/W2024353273","https://openalex.org/W2070947892","https://openalex.org/W2084029055","https://openalex.org/W2102824199"],"related_works":["https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W1648222467","https://openalex.org/W2566439177","https://openalex.org/W2023299357","https://openalex.org/W2952674952","https://openalex.org/W1924853520","https://openalex.org/W2135815643","https://openalex.org/W2038659996","https://openalex.org/W2062585124"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"new":[5],"results":[6],"on":[7],"sequential":[8],"and":[9,14],"parallel":[10],"construction":[11,92],"of":[12,93],"optimal":[13,94],"almost-optimal":[15],"length-restricted":[16,22,53,95],"prefix-free":[17,23],"codes.":[18],"We":[19,85],"show":[20],"that":[21,102],"codes":[24,96],"with":[25,48,55,79,97,107],"error":[26,56],"1/n":[27,57],"k":[28,31,58,61],"for":[29,59,90],"any":[30,60],">":[32],"0":[33],"can":[34,71],"be":[35,72],"constructed":[36,73],"in":[37,43,74,104],"O(n":[38],"log":[39,45,64,76,81],"n)":[40,46,77],"time,":[41],"or":[42],"O(":[44,75],"time":[47,78,106],"n":[49,82,108],"CREW":[50,83,109],"processors.":[51,84,110],"A":[52],"code":[54],"\u2264":[62],"L/":[63],"\u03a6":[65],"n,":[66],"where":[67],"[Formula:":[68],"see":[69],"text],":[70],"n/":[80],"also":[86],"describe":[87],"an":[88],"algorithm":[89],"the":[91],"maximum":[98],"codeword":[99],"length":[100],"L":[101],"works":[103],"O(L)":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}