{"id":"https://openalex.org/W2586445058","doi":"https://doi.org/10.1109/tit.2017.2663433","title":"Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers","display_name":"Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers","publication_year":2017,"publication_date":"2017-02-07","ids":{"openalex":"https://openalex.org/W2586445058","doi":"https://doi.org/10.1109/tit.2017.2663433","mag":"2586445058"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2663433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2663433","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/A5028550965","display_name":"Bruno Ten\u00f3rio \u00c1vila","orcid":"https://orcid.org/0000-0002-5409-8918"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Bruno T. Avila","raw_affiliation_strings":["Department of Information Science, Federal University of Pernambuco, Recife, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Information Science, Federal University of Pernambuco, Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103560321","display_name":"Ricardo M. Campello de Souza","orcid":"https://orcid.org/0009-0008-3262-6282"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ricardo M. Campello de Souza","raw_affiliation_strings":["Department of Electronics and Systems, Federal University of Pernambuco, Recife, Brazil"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Systems, Federal University of Pernambuco, Recife, Brazil","institution_ids":["https://openalex.org/I25112270"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028550965"],"corresponding_institution_ids":["https://openalex.org/I25112270"],"apc_list":null,"apc_paid":null,"fwci":0.6192,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74473605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"4","first_page":"2357","last_page":"2375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"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/fibonacci-number","display_name":"Fibonacci number","score":0.8450068831443787},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.6613645553588867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5840643048286438},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5515760779380798},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5507550835609436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5331686735153198},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4408136308193207},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3950035870075226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3486497104167938},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3374207615852356},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.299674928188324},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2904921770095825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2609899640083313},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11108475923538208}],"concepts":[{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.8450068831443787},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.6613645553588867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5840643048286438},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5515760779380798},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5507550835609436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5331686735153198},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4408136308193207},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3950035870075226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3486497104167938},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3374207615852356},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.299674928188324},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2904921770095825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2609899640083313},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11108475923538208},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2017.2663433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2663433","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":[{"display_name":"Quality Education","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W50777510","https://openalex.org/W278885493","https://openalex.org/W1975489634","https://openalex.org/W1982887912","https://openalex.org/W1993742159","https://openalex.org/W2002517766","https://openalex.org/W2013219079","https://openalex.org/W2013367214","https://openalex.org/W2032096121","https://openalex.org/W2042100531","https://openalex.org/W2068841489","https://openalex.org/W2073097300","https://openalex.org/W2076050346","https://openalex.org/W2089123918","https://openalex.org/W2103198064","https://openalex.org/W2104941534","https://openalex.org/W2106596127","https://openalex.org/W2116045215","https://openalex.org/W2119379114","https://openalex.org/W2126185163","https://openalex.org/W2128777897","https://openalex.org/W2143603891","https://openalex.org/W2324549590","https://openalex.org/W4235483809","https://openalex.org/W6610054260","https://openalex.org/W6678005163"],"related_works":["https://openalex.org/W2118040516","https://openalex.org/W2107900237","https://openalex.org/W3039723386","https://openalex.org/W2069056415","https://openalex.org/W3102830890","https://openalex.org/W2555819404","https://openalex.org/W2033806151","https://openalex.org/W3140261953","https://openalex.org/W2121274016","https://openalex.org/W247640849","https://openalex.org/W3104417989","https://openalex.org/W2142832396","https://openalex.org/W1614207627","https://openalex.org/W2063181761","https://openalex.org/W2098183759","https://openalex.org/W2104941534","https://openalex.org/W2100178828","https://openalex.org/W2116159080","https://openalex.org/W2743828512","https://openalex.org/W333541451"],"abstract_inverted_index":{"In":[0,141],"this":[1,81],"paper,":[2],"we":[3,83,95,144],"address":[4],"the":[5,8,33,70,75,78,86,89,114,118,151],"problem":[6],"of":[7,11,32,57,68,77,80,88,117,154],"universal":[9,49,104],"coding":[10],"natural":[12,107],"numbers.":[13,108],"A":[14],"new":[15,38],"numeration":[16,35,39],"system":[17,40],"is":[18,21,29,41,60,111,134,159],"introduced,":[19],"which":[20],"based":[22],"on":[23],"variable-r":[24],"meta-Fibonacci":[25,52,146],"sequences":[26],"and":[27,125,130,148],"it":[28],"a":[30,66,98],"generalization":[31],"Zeckendorf":[34],"system.":[36],"This":[37,92],"used":[42],"to":[43,113,162,176],"construct":[44],"binary,":[45],"prefix-free,":[46],"uniquely":[47],"decodable":[48],"codes":[50,59,147],"called":[51],"codes.":[53],"The":[54,171],"main":[55],"advantage":[56],"these":[58,139,168],"that":[61,94,150,180],"they":[62],"are":[63],"parametrized":[64],"by":[65,123],"sequence":[67,71],"numbers,":[69],"o.":[72],"By":[73],"controlling":[74],"growth":[76],"values":[79],"sequence,":[82],"can":[84,96],"control":[85],"length":[87,121,158],"code":[90,119,137,156],"word.":[91],"means":[93],"provide":[97],"general":[99],"framework":[100,110,172],"for":[101,106],"building":[102],"efficient":[103],"coders":[105],"Such":[109],"applied":[112,175],"upper":[115,152,178],"bounds":[116,179],"word":[120,157],"defined":[122],"Leung-Yan-Cheong":[124],"Cover":[126],"(1978),":[127],"Levenshtein":[128],"(1968),":[129],"Ahlswede":[131],"(1997).":[132],"There":[133],"no":[135],"other":[136,177],"meeting":[138],"bounds.":[140],"each":[142],"case,":[143],"build":[145],"demonstrate":[149],"bound":[153],"their":[155],"satisfied":[160],"up":[161],"an":[163],"additive":[164],"constant,":[165],"thereby":[166],"solving":[167],"open":[169],"problems.":[170],"may":[173],"be":[174],"satisfy":[181],"Kraft":[182],"inequality.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}