{"id":"https://openalex.org/W7204972154","doi":"https://doi.org/10.48550/arxiv.2608.29631","title":"Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance","display_name":"Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance","publication_year":2026,"publication_date":"2026-08-30","ids":{"openalex":"https://openalex.org/W7204972154","doi":"https://doi.org/10.48550/arxiv.2608.29631"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.29631","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29631","pdf_url":"https://arxiv.org/pdf/2608.29631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.29631","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128164357","display_name":"Antonio Jes\u00fas Lorite L\u00f3pez","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I52354020","display_name":"University of Almer\u00eda","ror":"https://ror.org/003d3xx08","country_code":"ES","type":"education","lineage":["https://openalex.org/I52354020"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Lorite-L\u00f3pez, Antonio Jes\u00fas","raw_affiliation_strings":["Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain","institution_ids":["https://openalex.org/I52354020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030994817","display_name":"Daniel Camaz\u00f3n Portela","orcid":"https://orcid.org/0000-0002-5363-5697","observed_orcids":["https://orcid.org/0000-0002-5363-5697"]},"institutions":[{"id":"https://openalex.org/I52354020","display_name":"University of Almer\u00eda","ror":"https://ror.org/003d3xx08","country_code":"ES","type":"education","lineage":["https://openalex.org/I52354020"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Camaz\u00f3n-Portela, Daniel","raw_affiliation_strings":["Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain","institution_ids":["https://openalex.org/I52354020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006555261","display_name":"Juan Antonio Lopez-Ramos","orcid":"https://orcid.org/0000-0002-7332-0641","observed_orcids":["https://orcid.org/0000-0002-7332-0641","https://orcid.org/0000-0002-2263-2178"]},"institutions":[{"id":"https://openalex.org/I52354020","display_name":"University of Almer\u00eda","ror":"https://ror.org/003d3xx08","country_code":"ES","type":"education","lineage":["https://openalex.org/I52354020"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"L\u00f3pez-Ramos, Juan Antonio","raw_affiliation_strings":["Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Almer\u00eda , Carretera Sacramento , SN , Almer\u00eda , 04120 , Spain","institution_ids":["https://openalex.org/I52354020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52354020"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T11130","display_name":"Coding theory and cryptography","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.0015999999595806003,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"simplicial complexes","score":0.890999972820282},{"id":"https://openalex.org/keywords/binary-linear-codes","display_name":"binary linear codes","score":0.9129999876022339},{"id":"https://openalex.org/keywords/polynomial-time-decoding","display_name":"polynomial-time decoding","score":0.9580000042915344},{"id":"https://openalex.org/keywords/decoding-algorithms","display_name":"decoding algorithms","score":0.6859999895095825},{"id":"https://openalex.org/keywords/error-correction-capability","display_name":"error correction capability","score":0.9380000233650208},{"id":"https://openalex.org/keywords/asymptotic-optimality","display_name":"asymptotic optimality","score":0.7620000243186951}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7967000007629395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7039999961853027},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5958999991416931},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5530999898910522},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5389999747276306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47940000891685486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4632999897003174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4392000138759613},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41449999809265137},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C64245159","wikidata":"https://www.wikidata.org/wiki/Q3983972","display_name":"Simplicial approximation theorem","level":5,"score":0.37439998984336853},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3662000000476837},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.34049999713897705},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.34049999713897705},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.2919999957084656},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2651999890804291}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.29631","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29631","pdf_url":"https://arxiv.org/pdf/2608.29631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.29631","doi":"https://doi.org/10.48550/arxiv.2608.29631","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.29631","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.29631","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29631","pdf_url":"https://arxiv.org/pdf/2608.29631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G410571670","display_name":null,"funder_award_id":"10.13039/501100011033","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G4509960801","display_name":null,"funder_award_id":"PID2022-138906NB-C21","funder_id":"https://openalex.org/F4320335598","funder_display_name":"Agencia Estatal de Investigaci\u00f3n"},{"id":"https://openalex.org/G451917667","display_name":null,"funder_award_id":"13039/501100011033","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G5539308778","display_name":null,"funder_award_id":"AEI/10.13039/501100011033","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G5967599077","display_name":null,"funder_award_id":"501100011033","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G6296285101","display_name":null,"funder_award_id":"PID2022-138906NB-C21","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"}],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320335598","display_name":"Agencia Estatal de Investigaci\u00f3n","ror":"https://ror.org/003x0zc53"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204972154.pdf","grobid_xml":"https://content.openalex.org/works/W7204972154.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W124957499","https://openalex.org/W2972773272","https://openalex.org/W61650635","https://openalex.org/W4417290541","https://openalex.org/W2078502923","https://openalex.org/W7046277207","https://openalex.org/W1969206571","https://openalex.org/W2989178985","https://openalex.org/W2039133144","https://openalex.org/W4290930502"],"abstract_inverted_index":{"In":[0],"this":[1,27,61,117],"work,":[2],"we":[3,105],"propose":[4],"an":[5,46],"efficient":[6],"decoding":[7,24],"algorithm":[8,34,114],"for":[9,21],"codes":[10,20],"arising":[11],"from":[12,54],"simplicial":[13,110],"complexes,":[14],"a":[15],"family":[16],"of":[17,26,57,91,109],"binary":[18],"linear":[19],"which":[22],"no":[23],"method":[25],"type":[28],"was":[29],"previously":[30],"known.":[31],"Although":[32],"the":[33,39,55,58,66,69,74,81,89,92,113],"does":[35],"not":[36],"always":[37],"attain":[38],"maximum":[40,76],"theoretical":[41,75,118],"error-correcting":[42],"capability,":[43],"it":[44],"provides":[45],"explicit":[47],"bound":[48,62],"that":[49],"can":[50],"be":[51],"computed":[52],"directly":[53],"structure":[56],"complex.":[59],"Moreover,":[60],"is":[63,98],"asymptotically":[64],"optimal:":[65],"ratio":[67],"between":[68],"guaranteed":[70],"correcting":[71],"capability":[72,97],"and":[73],"converges":[77],"to":[78],"$1$":[79],"as":[80],"code":[82],"length":[83],"increases,":[84],"under":[85],"natural":[86],"assumptions":[87],"on":[88],"dimension":[90],"maximal":[93],"faces.":[94],"The":[95],"correction":[96],"also":[99],"presented":[100],"in":[101],"specific":[102,107],"examples.":[103],"Finally,":[104],"introduce":[106],"families":[108],"complexes":[111],"where":[112],"successfully":[115],"reaches":[116],"bound.":[119]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-09-02T00:00:00"}