{"id":"https://openalex.org/W7129723039","doi":"https://doi.org/10.48550/arxiv.2602.13548","title":"Redundancy-Optimal Constructions of $(1,1)$-Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms","display_name":"Redundancy-Optimal Constructions of $(1,1)$-Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms","publication_year":2026,"publication_date":"2026-02-14","ids":{"openalex":"https://openalex.org/W7129723039","doi":"https://doi.org/10.48550/arxiv.2602.13548"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.13548","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Liu, Wenhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Liu, Wenhao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114734261","display_name":"Zhengyi Jiang","orcid":"https://orcid.org/0000-0002-2060-1108"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Zhengyi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101599983","display_name":"Zhongyi Huang","orcid":"https://orcid.org/0009-0000-2512-6054"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Zhongyi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126228770","display_name":"Hanxu Hou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hou, Hanxu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9254999756813049,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9254999756813049,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.019700000062584877,"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.010900000110268593,"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/redundancy","display_name":"Redundancy (engineering)","score":0.7979999780654907},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.6615999937057495},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6237999796867371},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5982000231742859},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.48590001463890076},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4830999970436096},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4097999930381775},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.3743000030517578}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7979999780654907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7071999907493591},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6615999937057495},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6237999796867371},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5982000231742859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5187000036239624},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.48590001463890076},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4830999970436096},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3743000030517578},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36039999127388},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.35899999737739563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3546999990940094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34290000796318054},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.259799987077713}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.13548","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.13548","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.13548","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.13548","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Two-dimensional":[0],"error-correcting":[1],"codes,":[2,24],"where":[3],"codewords":[4],"are":[5,42,131],"represented":[6],"as":[7,22],"$n":[8,76,101],"\\times":[9],"n$":[10],"arrays":[11],"over":[12],"a":[13,61,111],"$q$-ary":[14,54],"alphabet,":[15],"find":[16],"important":[17],"applications":[18],"in":[19],"areas":[20],"such":[21,114],"QR":[23],"DNA-based":[25],"storage,":[26],"and":[27,39,65,70,79,90,104,123,180],"racetrack":[28],"memories.":[29],"Among":[30],"the":[31,86,120,124,128,140,154,161,167],"possible":[32],"error":[33],"patterns,":[34],"$(t_r,t_c)$-criss-cross":[35],"deletions-where":[36],"$t_r$":[37],"rows":[38],"$t_c$":[40],"columns":[41],"simultaneously":[43,176],"deleted-are":[44],"of":[45,85,127,156],"particular":[46],"significance.":[47],"In":[48],"this":[49,159],"paper,":[50],"we":[51,97],"focus":[52],"on":[53],"$(1,1)$-criss-cross":[55],"deletion":[56],"correcting":[57],"codes.":[58],"We":[59],"present":[60],"novel":[62],"code":[63,121],"construction":[64,163],"develop":[66],"complete":[67],"encoding,":[68,88],"decoding,":[69,89],"data":[71,91],"recovery":[72,92],"algorithms":[73,93],"for":[74,100],"parameters":[75],"\\ge":[77,81,102,117],"11$":[78,103],"$q":[80,105,116],"3$.":[82],"The":[83],"complexity":[84],"proposed":[87],"is":[94,160],"$\\mathcal{O}(n^2)$.":[95],"Furthermore,":[96],"show":[98],"that":[99,115,164],"=":[106],"\u03a9(n)$":[107],"(i.e.,":[108],"there":[109],"exists":[110],"constant":[112],"$c>0$":[113],"cn$),":[118],"both":[119],"redundancy":[122,126,169],"encoder":[125],"constructed":[129],"codes":[130],"$2n":[132],"+":[133,136,144],"2\\log_q":[134,145],"n":[135,146],"\\mathcal{O}(1)$,":[137],"which":[138],"attain":[139],"lower":[141],"bound":[142],"($2n":[143],"-":[147],"3$)":[148],"within":[149],"an":[150,172],"$\\mathcal{O}(1)$":[151,173],"gap.":[152],"To":[153],"best":[155],"our":[157],"knowledge,":[158],"first":[162],"can":[165],"achieve":[166],"optimal":[168],"with":[170],"only":[171],"gap,":[174],"while":[175],"featuring":[177],"explicit":[178],"encoding":[179],"decoding":[181],"algorithms.":[182]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-18T00:00:00"}