{"id":"https://openalex.org/W4416514272","doi":"https://doi.org/10.1109/itw62417.2025.11240270","title":"From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint","display_name":"From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4416514272","doi":"https://doi.org/10.1109/itw62417.2025.11240270"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5120495076","display_name":"Viet Hai Le","orcid":null},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Viet Hai Le","raw_affiliation_strings":["Singapore University of Technology and Design,Singapore,487372"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Singapore University of Technology and Design,Singapore,487372","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000813059","display_name":"Thanh Phong Pham","orcid":"https://orcid.org/0009-0000-7996-8871"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Thanh Phong Pham","raw_affiliation_strings":["Nanyang Technological University,Singapore,639798"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University,Singapore,639798","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101956736","display_name":"Tuan Thanh Nguyen","orcid":"https://orcid.org/0000-0003-0055-8218"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Tuan Thanh Nguyen","raw_affiliation_strings":["Singapore University of Technology and Design,Singapore,487372"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Singapore University of Technology and Design,Singapore,487372","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042415594","display_name":"Kui Cai","orcid":"https://orcid.org/0000-0003-2059-0071"},"institutions":[{"id":"https://openalex.org/I152815399","display_name":"Singapore University of Technology and Design","ror":"https://ror.org/05j6fvn87","country_code":"SG","type":"education","lineage":["https://openalex.org/I152815399"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kui Cai","raw_affiliation_strings":["Singapore University of Technology and Design,Singapore,487372"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Singapore University of Technology and Design,Singapore,487372","institution_ids":["https://openalex.org/I152815399"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020855511","display_name":"Kees A. Schouhamer Immink","orcid":"https://orcid.org/0000-0001-6747-9261"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kees A. Schouhamer Immink","raw_affiliation_strings":["Turing Machines Inc,DK Rotterdam,The Netherlands,3016"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Turing Machines Inc,DK Rotterdam,The Netherlands,3016","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"839","last_page":"844"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.8675000071525574,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.8675000071525574,"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/T12162","display_name":"Cellular Automata and Applications","score":0.028999999165534973,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.00989999994635582,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/constraint","display_name":"Constraint (computer-aided design)","score":0.5922999978065491},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5116999745368958},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44279998540878296},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.43869999051094055},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.40689998865127563},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.39969998598098755},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.38920000195503235},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.3849000036716461}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5922999978065491},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5116999745368958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4941999912261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44999998807907104},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44279998540878296},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.43869999051094055},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.39969998598098755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39340001344680786},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.38920000195503235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3853999972343445},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.3849000036716461},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.33379998803138733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31450000405311584},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2840000092983246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28200000524520874},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.2700999975204468},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.26260000467300415},{"id":"https://openalex.org/C6899612","wikidata":"https://www.wikidata.org/wiki/Q852911","display_name":"Resistive touchscreen","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W636820564","https://openalex.org/W1489945671","https://openalex.org/W1987232115","https://openalex.org/W2035175249","https://openalex.org/W2098019199","https://openalex.org/W2109016716","https://openalex.org/W2111550877","https://openalex.org/W2125636047","https://openalex.org/W2126856948","https://openalex.org/W2127404904","https://openalex.org/W2129734332","https://openalex.org/W2156197625","https://openalex.org/W2495105903","https://openalex.org/W2769372735","https://openalex.org/W2962809499","https://openalex.org/W2963334792","https://openalex.org/W3012140524","https://openalex.org/W3080116245","https://openalex.org/W3090719043","https://openalex.org/W3184008446","https://openalex.org/W3196920833","https://openalex.org/W3205871190","https://openalex.org/W4289655317","https://openalex.org/W4321021492","https://openalex.org/W4386066449","https://openalex.org/W4386075148","https://openalex.org/W4390693801","https://openalex.org/W4401692005"],"related_works":[],"abstract_inverted_index":{"Recent":[0],"developments":[1],"in":[2,5,58,99],"storage-":[3],"especially":[4],"the":[6,18,23,42,48,59,61,85,114,120,127,146],"area":[7],"of":[8,30,36,78,87,130,148,154,175],"resistive":[9],"random":[10],"access":[11],"memory":[12],"(ReRAM)-":[13],"are":[14,39],"attempting":[15],"to":[16,46,113,140,157],"scale":[17],"storage":[19],"density":[20],"by":[21],"regarding":[22],"information":[24,44],"data":[25,45],"as":[26],"two-dimensional":[27],"(2D),":[28],"instead":[29],"one-dimensional":[31],"(1D).":[32],"Correspondingly,":[33],"new":[34],"types":[35],"2D":[37,64,90,142,185],"constraints":[38,53,65],"introduced":[40],"into":[41],"input":[43],"improve":[47],"system":[49],"reliability.":[50],"While":[51],"1D":[52,79,177],"have":[54],"been":[55,105],"extensively":[56],"investigated":[57],"literature,":[60],"study":[62],"for":[63,119,162,187],"is":[66],"much":[67],"less":[68],"profound.":[69],"Particularly,":[70],"given":[71,164],"a":[72,76,106,137,173],"constraint":[73],"${\\mathcal{F}}$":[74],"and":[75,96,151],"design":[77,141,174],"codes":[80,124,143,186],"whose":[81],"codewords":[82],"satisfy":[83,102],"${\\mathcal{F}}$,":[84,103],"problem":[86,117],"constructing":[88],"efficient":[89,111],"codes,":[91,178],"such":[92],"that":[93,125,144,169],"every":[94,97,100,149,152],"row":[95,150],"column":[98,153],"codeword":[101],"has":[104],"challenge.This":[107],"work":[108],"provides":[109,183],"an":[110],"solution":[112],"challenging":[115],"coding":[116],"above":[118],"binary":[121],"bounded-weight":[122],"constrained":[123],"restrict":[126],"maximum":[128],"number":[129],"1\u2019s":[131],"(called":[132],"weight).":[133],"Formally,":[134],"we":[135],"propose":[136],"universal":[138],"framework":[139],"guarantee":[145],"weight":[147],"length":[155],"n":[156],"be":[158],"at":[159],"most":[160],"f(n)":[161],"any":[163],"function":[165],"f(n).":[166],"We":[167],"show":[168],"if":[170],"there":[171],"exists":[172],"capacity-approaching":[176,184],"then":[179],"our":[180],"method":[181],"also":[182],"all":[188],"f":[189],"=":[190],"\u03c9(log":[191],"n).":[192]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-11-23T00:00:00"}