{"id":"https://openalex.org/W1586480211","doi":"https://doi.org/10.1109/isit.2008.4595435","title":"Reserved-length prefix coding","display_name":"Reserved-length prefix coding","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W1586480211","doi":"https://doi.org/10.1109/isit.2008.4595435","mag":"1586480211"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595435","doi":"https://doi.org/10.1109/isit.2008.4595435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595435","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0801.0102","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023602778","display_name":"Michael B. Baer","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael B. Baer","raw_affiliation_strings":["Mountain View, CA, USA","vLnks, Mountain View, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mountain View, CA, USA","institution_ids":[]},{"raw_affiliation_string":"vLnks, Mountain View, CA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023602778"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.548,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52342704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"78","issue":null,"first_page":"2469","last_page":"2473"},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.0,"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/T11130","display_name":"Coding theory and cryptography","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8080000281333923},{"id":"https://openalex.org/keywords/optimal-prefix-codes","display_name":"optimal prefix codes","score":0.7129999995231628},{"id":"https://openalex.org/keywords/dynamic-programming-algorithm","display_name":"dynamic programming algorithm","score":0.8659999966621399},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"lossless compression","score":0.7889999747276306},{"id":"https://openalex.org/keywords/constant-space-algorithms","display_name":"constant-space algorithms","score":0.5630000233650208},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.8849999904632568}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8386597633361816},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.7892729043960571},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5239360928535461},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.48729097843170166},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4786306917667389},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4645305573940277},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.46352869272232056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45800164341926575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45601537823677063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4294889569282532},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3877306282520294},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3643723726272583},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.346943736076355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3255128264427185},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.25293421745300293},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit.2008.4595435","doi":"https://doi.org/10.1109/isit.2008.4595435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595435","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:0801.0102","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0801.0102","pdf_url":"https://arxiv.org/pdf/0801.0102","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.245.5189","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.245.5189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0801.0102v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.515.7737","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.515.7737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hkn.eecs.berkeley.edu/~calbear/research/ISITres.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0801.0102","doi":"https://doi.org/10.48550/arxiv.0801.0102","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0801.0102","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0801.0102","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0801.0102","pdf_url":"https://arxiv.org/pdf/0801.0102","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1586480211.pdf","grobid_xml":"https://content.openalex.org/works/W1586480211.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1634005169","https://openalex.org/W1998631532","https://openalex.org/W2025911687","https://openalex.org/W2060108852","https://openalex.org/W2099111195","https://openalex.org/W2108189215","https://openalex.org/W2112710299","https://openalex.org/W2144057369","https://openalex.org/W2148949320","https://openalex.org/W2157505333","https://openalex.org/W2159266843","https://openalex.org/W2169476932","https://openalex.org/W2171071472","https://openalex.org/W2296319761","https://openalex.org/W2327767063","https://openalex.org/W2329924640","https://openalex.org/W2478708596","https://openalex.org/W2889395214","https://openalex.org/W3101263247"],"related_works":["https://openalex.org/W4394670340","https://openalex.org/W1671483240","https://openalex.org/W4394651879","https://openalex.org/W2157505333","https://openalex.org/W2160996252","https://openalex.org/W7096039353","https://openalex.org/W106140241","https://openalex.org/W7037266309","https://openalex.org/W2162023753","https://openalex.org/W2115012797"],"abstract_inverted_index":{"Huffman":[0],"coding":[1,68,91],"finds":[2,61,95],"an":[3,21],"optimal":[4,22,62,96],"prefix":[5,67,90],"code":[6,23],"for":[7,64,108],"a":[8,35,49,55,119],"given":[9],"probability":[10],"mass":[11],"function.":[12],"Consider":[13],"situations":[14],"in":[15,34,48],"which":[16],"one":[17,82],"wishes":[18],"to":[19,73,99],"find":[20],"with":[24,104],"the":[25,85,100],"restriction":[26],"that":[27,32,46,60],"all":[28],"codewords":[29,43],"have":[30,44],"lengths":[31,39,45,107],"lie":[33,47],"user-specified":[36,109],"set":[37,101],"of":[38,84,102],"(or,":[40],"equivalently,":[41],"no":[42],"complementary":[50],"set).":[51],"This":[52,70],"paper":[53],"introduces":[54],"polynomial-time":[56],"dynamic":[57],"programming":[58],"algorithm":[59],"codes":[63,97,103],"this":[65],"reserved-length":[66],"problem.":[69],"has":[71],"applications":[72],"quickly":[74],"encoding":[75],"and":[76],"decoding":[77],"lossless":[78],"codes.":[79],"In":[80],"addition,":[81],"modification":[83],"approach":[86,122],"solves":[87],"any":[88],"quasiarithmetic":[89],"problem,":[92],"while":[93],"another":[94],"restricted":[98],"g":[105,110,112],"codeword":[106],"(e.g.,":[111],"=":[113],"2).":[114],"For":[115],"small":[116],"enough":[117],"g,":[118],"sublinear-time":[120],"constant-space":[121],"is":[123],"even":[124],"more":[125],"efficient.":[126]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}