{"id":"https://openalex.org/W4415366950","doi":"https://doi.org/10.1109/isit63088.2025.11195631","title":"A Lower Bound of Worst-Case Redundancy of $k$-Symbol Delay Decodable Codes","display_name":"A Lower Bound of Worst-Case Redundancy of $k$-Symbol Delay Decodable Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366950","doi":"https://doi.org/10.1109/isit63088.2025.11195631"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195631","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/A5080033205","display_name":"Kengo Hashimoto","orcid":"https://orcid.org/0000-0001-5836-0023"},"institutions":[{"id":"https://openalex.org/I111966504","display_name":"University of Fukui","ror":"https://ror.org/00msqp585","country_code":"JP","type":"education","lineage":["https://openalex.org/I111966504"]},{"id":"https://openalex.org/I125590103","display_name":"Fukui University of Technology","ror":"https://ror.org/01tm0rr86","country_code":"JP","type":"education","lineage":["https://openalex.org/I125590103"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kengo Hashimoto","raw_affiliation_strings":["University of Fukui,Department of Information Science,Fukui,Japan"],"affiliations":[{"raw_affiliation_string":"University of Fukui,Department of Information Science,Fukui,Japan","institution_ids":["https://openalex.org/I111966504","https://openalex.org/I125590103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013763523","display_name":"Ken\u2010ichi Iwata","orcid":"https://orcid.org/0000-0002-8838-375X"},"institutions":[{"id":"https://openalex.org/I125590103","display_name":"Fukui University of Technology","ror":"https://ror.org/01tm0rr86","country_code":"JP","type":"education","lineage":["https://openalex.org/I125590103"]},{"id":"https://openalex.org/I111966504","display_name":"University of Fukui","ror":"https://ror.org/00msqp585","country_code":"JP","type":"education","lineage":["https://openalex.org/I111966504"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-ichi Iwata","raw_affiliation_strings":["University of Fukui,Department of Information Science,Fukui,Japan"],"affiliations":[{"raw_affiliation_string":"University of Fukui,Department of Information Science,Fukui,Japan","institution_ids":["https://openalex.org/I111966504","https://openalex.org/I125590103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080033205"],"corresponding_institution_ids":["https://openalex.org/I111966504","https://openalex.org/I125590103"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37391641,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9977999925613403,"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/T12029","display_name":"DNA and Biological Computing","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7573000192642212},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.7401000261306763},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6758000254631042},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5917999744415283},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5619000196456909},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.35370001196861267},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.3427000045776367}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7573000192642212},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.7401000261306763},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6758000254631042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6711000204086304},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5917999744415283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5619000196456909},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5619000196456909},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43059998750686646},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3407000005245209},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3197000026702881},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3084000051021576},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.29809999465942383},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195631","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2169081284","https://openalex.org/W2592595055","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W3196459517","https://openalex.org/W4293404332","https://openalex.org/W4297970758","https://openalex.org/W4312409941","https://openalex.org/W4379033773","https://openalex.org/W4386085351","https://openalex.org/W4386473702","https://openalex.org/W4386702597","https://openalex.org/W4404609151","https://openalex.org/W4413887358"],"related_works":[],"abstract_inverted_index":{"The":[0],"class":[1],"of":[2,12,29,37,45,59,63,92],"<tex":[3,48,64,67,74],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[4,49,65,68,75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>-symbol":[5,69],"delay":[6,44,70],"decodable":[7,71],"code-tuples":[8,72],"is":[9],"a":[10,34,42,56,84,89],"set":[11],"noiseless":[13],"source":[14],"codes,":[15],"which":[16],"can":[17],"achieve":[18],"an":[19],"average":[20,94],"codeword":[21,95],"length":[22],"less":[23],"than":[24],"or":[25],"equal":[26],"to":[27],"that":[28,87],"Huffman":[30],"codes":[31],"by":[32,82],"utilizing":[33],"finite":[35],"number":[36],"code":[38],"tables":[39],"and":[40],"allowing":[41],"decoding":[43],"at":[46],"most":[47],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[50],"coding":[51],"symbols.":[52],"This":[53],"paper":[54],"establishes":[55],"lower":[57,90],"bound":[58,91],"the":[60,93],"worst-case":[61],"redundancy":[62],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>-ary":[66],"for":[73],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d":[76],"\\geq":[77,80],"2,":[78],"k":[79],"1$</tex>":[81],"proving":[83],"stronger":[85],"theorem":[86],"provides":[88],"length.":[96]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}