{"id":"https://openalex.org/W2052719616","doi":"https://doi.org/10.1109/tit.1981.1056322","title":"Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)","display_name":"Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)","publication_year":1981,"publication_date":"1981-03-01","ids":{"openalex":"https://openalex.org/W2052719616","doi":"https://doi.org/10.1109/tit.1981.1056322","mag":"2052719616"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1981.1056322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1981.1056322","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/A5038437382","display_name":"P.A. Humblet","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":true,"raw_author_name":"P. Humblet","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science and the Laboratory for Information and Decisipns Systems, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science and the Laboratory for Information and Decisipns Systems, 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":["https://openalex.org/A5038437382"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.10627598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":"2","first_page":"230","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9706000089645386,"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/huffman-coding","display_name":"Huffman coding","score":0.9115694761276245},{"id":"https://openalex.org/keywords/buffer-overflow","display_name":"Buffer overflow","score":0.8131293058395386},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6983985304832458},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5165290236473083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5111265778541565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48969367146492004},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47478362917900085},{"id":"https://openalex.org/keywords/buffer","display_name":"Buffer (optical fiber)","score":0.45113497972488403},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4489625096321106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42073673009872437},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4144303500652313},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.41401636600494385},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4099242091178894},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3655911684036255},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3044244349002838},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.18354234099388123},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12865185737609863}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9115694761276245},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.8131293058395386},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6983985304832458},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5165290236473083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5111265778541565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48969367146492004},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47478362917900085},{"id":"https://openalex.org/C145018004","wikidata":"https://www.wikidata.org/wiki/Q4985944","display_name":"Buffer (optical fiber)","level":2,"score":0.45113497972488403},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4489625096321106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42073673009872437},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4144303500652313},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.41401636600494385},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4099242091178894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3655911684036255},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3044244349002838},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.18354234099388123},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12865185737609863},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1981.1056322","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1981.1056322","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":[{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1631150563","https://openalex.org/W1988065917","https://openalex.org/W1989008275","https://openalex.org/W2013094118","https://openalex.org/W2060108852","https://openalex.org/W2077623653","https://openalex.org/W2109227390","https://openalex.org/W2142901448"],"related_works":["https://openalex.org/W4296567424","https://openalex.org/W4312409941","https://openalex.org/W2920861277","https://openalex.org/W2125569068","https://openalex.org/W2586352442","https://openalex.org/W2742651484","https://openalex.org/W1607635215","https://openalex.org/W2344988652","https://openalex.org/W2124491094","https://openalex.org/W2387933163"],"abstract_inverted_index":{"An":[0],"algorithm":[1,30],"is":[2,31],"given":[3,26],"to":[4,37],"find":[5],"a":[6,25,39],"prefix":[7],"condition":[8],"code":[9,40],"that":[10,41],"minimizes":[11],"the":[12,15,20,43,48,54],"value":[13],"of":[14,19,45,47,50],"moment":[16],"generating":[17],"function":[18],"codeword":[21],"length":[22,56],"distribution":[23],"for":[24],"positive":[27],"argument.":[28],"This":[29],"used":[32],"in":[33],"an":[34],"iterative":[35],"way":[36],"yield":[38],"maximizes":[42],"rate":[44],"decay":[46],"probability":[49],"buffer":[51,55],"overflow":[52],"as":[53],"increases.":[57]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}