{"id":"https://openalex.org/W4415368153","doi":"https://doi.org/10.1109/isit63088.2025.11195687","title":"Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications","display_name":"Optimal Binary Variable-Length Codes with a Bounded Number of 1's Per Codeword: Design, Analysis, and Applications","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368153","doi":"https://doi.org/10.1109/isit63088.2025.11195687"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5094034761","display_name":"Roberto Bruno","orcid":"https://orcid.org/0000-0001-6039-2075"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Roberto Bruno","raw_affiliation_strings":["University of Salerno,Department of Computer Science,Fisciano,SA,Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026243357","display_name":"Roberto De Prisco","orcid":"https://orcid.org/0000-0003-0559-6897"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto De Prisco","raw_affiliation_strings":["University of Salerno,Department of Computer Science,Fisciano,SA,Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012067736","display_name":"Ugo Vaccaro","orcid":"https://orcid.org/0000-0003-4085-7300"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ugo Vaccaro","raw_affiliation_strings":["University of Salerno,Department of Computer Science,Fisciano,SA,Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno,Department of Computer Science,Fisciano,SA,Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5094034761"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16450031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9962000250816345,"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/T11130","display_name":"Coding theory and cryptography","score":0.9962000250816345,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5745999813079834},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5418999791145325},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4927000105381012},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4690000116825104},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.4207000136375427},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.39660000801086426},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.3352999985218048},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.2937000095844269}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6121000051498413},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5418999791145325},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4927000105381012},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4925999939441681},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.4207000136375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39910000562667847},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.39660000801086426},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3352999985218048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3264000117778778},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32089999318122864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31139999628067017},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.25920000672340393},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W84899576","https://openalex.org/W1580838017","https://openalex.org/W1582033156","https://openalex.org/W1592300147","https://openalex.org/W1606793879","https://openalex.org/W1973390631","https://openalex.org/W1978520390","https://openalex.org/W1982998010","https://openalex.org/W1983520044","https://openalex.org/W1994636684","https://openalex.org/W2013021781","https://openalex.org/W2027121869","https://openalex.org/W2028246951","https://openalex.org/W2033751470","https://openalex.org/W2035367168","https://openalex.org/W2036526487","https://openalex.org/W2045041816","https://openalex.org/W2056204957","https://openalex.org/W2060108852","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2078591209","https://openalex.org/W2081450890","https://openalex.org/W2104037408","https://openalex.org/W2104932738","https://openalex.org/W2126711987","https://openalex.org/W2146944884","https://openalex.org/W2148949320","https://openalex.org/W2149258547","https://openalex.org/W2312272731","https://openalex.org/W2475478067","https://openalex.org/W2508579629","https://openalex.org/W2622763161","https://openalex.org/W2952044666","https://openalex.org/W3023755868","https://openalex.org/W3177697025","https://openalex.org/W4205551177","https://openalex.org/W4247011400","https://openalex.org/W4400648014","https://openalex.org/W4403276648","https://openalex.org/W4408928953"],"related_works":[],"abstract_inverted_index":{"In":[0,94],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,14,46,56,66,95,107,116,126,135,139],"problem":[6],"of":[7,48,58,72,128,141],"constructing":[8],"optimal":[9,83,89],"average-length":[10,84,90],"binary":[11,86,92,131],"codes":[12,73,87],"under":[13],"constraint":[15,137],"that":[16],"each":[17,144],"codeword":[18],"must":[19],"contain":[20],"at":[21],"most":[22],"<tex":[23,28,39,52,99,110],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[24,29,40,53,100,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$D$</tex>":[25,30],"ones,":[26],"where":[27,51,65],"is":[31,55],"a":[32,122],"given":[33],"input":[34],"parameter.":[35],"We":[36,60,119],"provide":[37,121],"an":[38],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(n^{2}":[41,101],"D\\right)$</tex>-time":[42,102],"complexity":[43,113],"algorithm":[44,103,114],"for":[45,115,125],"construction":[47],"such":[49],"codes,":[50,132],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[54],"number":[57,140],"codewords.":[59],"also":[61,120],"describe":[62],"several":[63],"scenarios":[64],"need":[67],"to":[68,80,134],"design":[69],"these":[70],"kinds":[71],"naturally":[74],"arises.":[75],"Our":[76],"algorithms":[77],"allow":[78],"us":[79],"construct":[81],"both":[82],"prefix":[85],"and":[88],"alphabetic":[91],"codes.":[93],"former":[96],"case,":[97],"our":[98],"substantially":[104],"improves":[105],"on":[106,138],"previously":[108],"known":[109],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(n^{2+D}\\right)$</tex>-time":[112],"same":[117],"problem.":[118],"Kraft-like":[123],"inequality":[124],"existence":[127],"(optimal)":[129],"variable-length":[130],"subject":[133],"above-described":[136],"1's":[142],"in":[143],"codeword.":[145]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}