{"id":"https://openalex.org/W2013094118","doi":"https://doi.org/10.1109/tit.1968.1054147","title":"Buffer overflow in variable length coding of fixed rate sources","display_name":"Buffer overflow in variable length coding of fixed rate sources","publication_year":1968,"publication_date":"1968-05-01","ids":{"openalex":"https://openalex.org/W2013094118","doi":"https://doi.org/10.1109/tit.1968.1054147","mag":"2013094118"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1968.1054147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054147","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/A5109975749","display_name":"F. Jelinek","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. Jelinek","raw_affiliation_strings":["School of Electrical Engineering and Center for Radiophysics and Space Research, Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Center for Radiophysics and Space Research, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109975749"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":1.7819,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.87568404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"490","last_page":"501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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.9988999962806702,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9965000152587891,"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/code-word","display_name":"Code word","score":0.6053534746170044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5303533673286438},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5232576131820679},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49199292063713074},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4658307433128357},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45789629220962524},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4543662369251251},{"id":"https://openalex.org/keywords/buffer-overflow","display_name":"Buffer overflow","score":0.42574605345726013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36637917160987854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36025166511535645},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.24290195107460022},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20618951320648193},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1102047860622406}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6053534746170044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5303533673286438},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5232576131820679},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49199292063713074},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4658307433128357},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45789629220962524},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4543662369251251},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.42574605345726013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36637917160987854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36025166511535645},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.24290195107460022},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20618951320648193},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1102047860622406}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1968.1054147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054147","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W158805393","https://openalex.org/W1509016759","https://openalex.org/W1976797517","https://openalex.org/W1998631532","https://openalex.org/W2001935257","https://openalex.org/W2060108852","https://openalex.org/W2122882636","https://openalex.org/W2128700225","https://openalex.org/W2169476932","https://openalex.org/W2751862591","https://openalex.org/W2753908209","https://openalex.org/W2993383518","https://openalex.org/W4300354131","https://openalex.org/W4396738453"],"related_works":["https://openalex.org/W2479612266","https://openalex.org/W2180474751","https://openalex.org/W2047431599","https://openalex.org/W1964132576","https://openalex.org/W2383174935","https://openalex.org/W2366163563","https://openalex.org/W2163885456","https://openalex.org/W2480896955","https://openalex.org/W1515628377","https://openalex.org/W2249843248"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,123],"develop":[4,124],"and":[5,72,100,122,129,139,172],"analyze":[6],"an":[7],"easily":[8],"instrumentable":[9],"scheme":[10],"for":[11],"variable":[12],"length":[13,55,149],"encoding":[14],"of":[15,40,51,91,120,136,160,167],"discrete":[16],"memoryless":[17],"fixed-rate":[18],"sources":[19],"in":[20,25,79],"which":[21],"buffer":[22,52,92],"overflows":[23],"result":[24,78],"codeword":[26],"erasures":[27],"at":[28],"locations":[29],"that":[30,74,108,133],"are":[31],"perfectly":[32],"specified":[33],"to":[34,63],"the":[35,49,58,80,89,118,134,145,155,161],"user.":[36],"Thus,":[37],"no":[38,175],"loss":[39],"synchronism":[41],"ever":[42],"occurs.":[43],"We":[44,105,131],"find":[45],"optimal":[46,111],"(i.e.,":[47],"minimizing":[48],"probability":[50,90],"overflow)":[53],"code-wold":[54],"requirements":[56],"under":[57],"Kraft":[59],"inequality":[60],"constraint,":[61],"relative":[62],"various":[64],"constant":[65],"transmission":[66],"rates":[67],"<tex":[68,150,157,168,180],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[69,151,158,169,181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">R</tex>":[70],",":[71,153,171],"show":[73,132],"these":[75,137],"do":[76],"not":[77],"minimal":[81],"average":[82],"code-word":[83],"length.":[84],"The":[85],"corresponding":[86,125],"bounds":[87],"on":[88],"overflow":[93],"provide":[94],"a":[95,165],"linkup":[96],"between":[97],"source":[98,103],"coding":[99],"R\u00e9nyi's":[101],"generalized":[102],"entropy.":[104],"show,":[106],"further,":[107],"codes":[109],"having":[110],"word":[112],"lengths":[113],"can":[114],"be":[115],"constructed":[116],"by":[117],"method":[119],"Elias,":[121],"sequentially":[126],"instrumented":[127],"encoders":[128,138],"decoders.":[130],"complexity":[135],"decoders":[140],"grows":[141,174],"only":[142],"linearly":[143],"with":[144,179],"encoded":[146],"message":[147],"block":[148],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</tex>":[152,182],"provided":[154],"size":[156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</tex>":[159],"coder":[162],"alphabet":[163],"is":[164],"power":[166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</tex>":[170],"otherwise":[173],"worse":[176],"than":[177],"quadratically":[178],".":[183]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}