{"id":"https://openalex.org/W1987177390","doi":"https://doi.org/10.1109/tcomm.2014.2329478","title":"Sequentially-Constructible Reversible Variable Length Codes","display_name":"Sequentially-Constructible Reversible Variable Length Codes","publication_year":2014,"publication_date":"2014-06-06","ids":{"openalex":"https://openalex.org/W1987177390","doi":"https://doi.org/10.1109/tcomm.2014.2329478","mag":"1987177390"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2014.2329478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2329478","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","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/A5053500333","display_name":"Sayed Jalal Zahabi","orcid":"https://orcid.org/0000-0001-5868-8192"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Sayed Jalal Zahabi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026035440","display_name":"Adel Aghajan","orcid":"https://orcid.org/0000-0003-0329-6102"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Adel Aghajan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090381199","display_name":"Mohammadali Khosravifard","orcid":"https://orcid.org/0000-0002-0645-7285"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammadali Khosravifard","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170013655"],"apc_list":null,"apc_paid":null,"fwci":0.8284,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80052813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"62","issue":"8","first_page":"2605","last_page":"2614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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.9948999881744385,"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.9944999814033508,"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/alphabet","display_name":"Alphabet","score":0.7211003303527832},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6557838916778564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5903253555297852},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5544346570968628},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5458183884620667},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4778939485549927},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3756539225578308},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33190953731536865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.306585431098938}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7211003303527832},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6557838916778564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5903253555297852},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5544346570968628},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5458183884620667},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4778939485549927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3756539225578308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33190953731536865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.306585431098938},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2014.2329478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2014.2329478","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.4399999976158142,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1505142331","https://openalex.org/W1979600080","https://openalex.org/W2013445432","https://openalex.org/W2031806265","https://openalex.org/W2033806151","https://openalex.org/W2039816259","https://openalex.org/W2045190631","https://openalex.org/W2055238318","https://openalex.org/W2060108852","https://openalex.org/W2096888720","https://openalex.org/W2107401732","https://openalex.org/W2108211616","https://openalex.org/W2110968394","https://openalex.org/W2127560848","https://openalex.org/W2142832396","https://openalex.org/W2143461819","https://openalex.org/W2149988068","https://openalex.org/W2155832272","https://openalex.org/W2166451469","https://openalex.org/W2478708596","https://openalex.org/W4300549156"],"related_works":["https://openalex.org/W4287724448","https://openalex.org/W3197609398","https://openalex.org/W2134460193","https://openalex.org/W1817064249","https://openalex.org/W1934065860","https://openalex.org/W2045410495","https://openalex.org/W2108149667","https://openalex.org/W2283788147","https://openalex.org/W2043525791","https://openalex.org/W2055365291"],"abstract_inverted_index":{"Dominant":[0],"codelength":[1,181],"sequences":[2,27,53,82,133],"for":[3,28,49,83,122,208],"reversible":[4],"variable":[5],"length":[6],"codes":[7,193],"(RVLCs)":[8],"have":[9],"been":[10],"recently":[11],"introduced":[12],"and":[13],"studied":[14],"as":[15,145,200,202],"a":[16,38,176],"means":[17],"to":[18,111,127,164,175,214],"looking":[19],"into":[20],"optimal":[21,106,113,229],"RVLCs.":[22,231],"However,":[23,75],"obtaining":[24,130],"the":[25,45,51,69,73,80,92,99,105,112,131,146,150,157,167,185,192,203,216,228],"dominant":[26,52,81,132,205],"RVLCs":[29,85,108,114,136],"is":[30,66,77,96,115,137,189],"computationally":[31],"challenging.":[32],"In":[33,162],"this":[34,63,196,219],"paper,":[35],"we":[36,170],"consider":[37],"special":[39],"subset":[40],"of":[41,71,91,125,134,149,178,212,218],"all":[42],"RVLCs,":[43,48],"namely,":[44],"sequentially-constructible":[46],"(SC)":[47],"which":[50,183],"can":[54],"be":[55],"obtained":[56,194],"with":[57,109],"less":[58],"computational":[59],"complexity.":[60],"Of":[61],"course,":[62],"time":[64,168],"saving":[65],"achieved":[67],"at":[68,116,222],"cost":[70],"losing":[72],"optimality.":[74],"it":[76,95,140],"shown":[78,190],"that":[79,98,191],"SC":[84,107,135,179,204,230],"provide":[86],"acceptable":[87],"performance":[88],"in":[89,103],"terms":[90],"redundancy.":[93],"Specifically,":[94,207],"seen":[97],"worst":[100],"case":[101],"penalty":[102],"using":[104],"respect":[110],"most":[117],"2/9":[118],"bit":[119,225],"per":[120],"symbol":[121],"alphabet":[123,159,210],"size":[124,160,211],"up":[126,213],"16.":[128],"While":[129],"relatively":[138],"faster,":[139],"will":[141],"still":[142],"become":[143],"challenging":[144],"search":[147],"space":[148],"relevant":[151],"branch-and-bound":[152,186],"algorithm":[153],"gets":[154],"larger,":[155],"when":[156],"source":[158],"increases.":[161],"order":[163],"further":[165],"reduce":[166],"complexity,":[169],"propose":[171],"an":[172,209],"alternative":[173],"approach":[174,197,220],"table":[177],"RVL":[180],"sequences,":[182],"avoids":[184],"algorithm.":[187],"It":[188],"by":[195],"perform":[198],"almost":[199],"well":[201],"sequences.":[206],"21,":[215],"redundancy":[217],"is,":[221],"most,":[223],"2/19":[224],"more":[226],"than":[227]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}