{"id":"https://openalex.org/W1977604687","doi":"https://doi.org/10.1109/tit.1976.1055546","title":"Complexity of acceptors for prefix codes (Corresp.)","display_name":"Complexity of acceptors for prefix codes (Corresp.)","publication_year":1976,"publication_date":"1976-05-01","ids":{"openalex":"https://openalex.org/W1977604687","doi":"https://doi.org/10.1109/tit.1976.1055546","mag":"1977604687"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1976.1055546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1976.1055546","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5109934995","display_name":"D. Brown","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Brown","raw_affiliation_strings":["Department of Electrical Engineering and the Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and the Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102921329","display_name":"Peter Elia\u0161","orcid":"https://orcid.org/0000-0002-2578-6535"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Elias","raw_affiliation_strings":["Department of Electrical Engineering and the Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and the Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06506739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"3","first_page":"357","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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/T12029","display_name":"DNA and Biological Computing","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/set","display_name":"Set (abstract data type)","score":0.527627170085907},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4935661554336548},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4339393079280853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39126238226890564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.389412522315979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35550370812416077},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.134550541639328}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.527627170085907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4935661554336548},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4339393079280853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39126238226890564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.389412522315979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35550370812416077},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.134550541639328}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1976.1055546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1976.1055546","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W158805393","https://openalex.org/W1989008275","https://openalex.org/W1995570217","https://openalex.org/W2060108852","https://openalex.org/W2128777897","https://openalex.org/W2142901448"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"For":[0],"a":[1,14,18,41,96],"given":[2],"finite":[3],"set":[4,20,22,97,102],"of":[5,16,23,58,88,98],"messages":[6],"and":[7],"their":[8],"assigned":[9],"probabilities,":[10],"Huffman's":[11],"procedure":[12],"gives":[13],"method":[15],"computing":[17],"length":[19,36,43,60,101],"(a":[21],"codeword":[24],"lengths)":[25],"that":[26,32],"is":[27,37,108],"optimal":[28],"in":[29,90],"the":[30,33,85],"sense":[31],"average":[34],"word":[35],"minimized.":[38],"Corresponding":[39],"to":[40],"particular":[42],"set,":[44],"however,":[45],"there":[46],"may":[47],"be":[48,84],"more":[49],"than":[50],"one":[51],"code.":[52],"Let":[53],"<tex":[54,65,72,79,103,113,119,130],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[55,66,73,80,104,114,120,131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L(n)</tex>":[56],"consist":[57],"all":[59,112],"sets":[61],"with":[62,100],"largest":[63],"term":[64],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</tex>":[67],",":[68,77,118],"and,":[69],"for":[70,111],"any":[71,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\ell":[74,132],"\\in":[75,133],"L(n)</tex>":[76,134],"let":[78],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">{\\cal":[81],"S}(":[82],"\\ell)</tex>":[83],"smallest":[86],"number":[87],"states":[89],"finite-state":[92],"acceptor":[93],"which":[94],"accepts":[95],"codewords":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\\ell</tex>":[105],".":[106],"It":[107],"shown":[109],"that,":[110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n":[115],"&gt;":[116],"1</tex>":[117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n^{2}/(16":[121],"\\log_{2}":[122],"n)":[123],"\\leq":[124,128],"max":[125],"{\\cal":[126],"S}(\\ell)":[127],"0(n^{2}).</tex>":[129]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}