{"id":"https://openalex.org/W7083465604","doi":"https://doi.org/10.48550/arxiv.2509.21112","title":"Adapt or Regress: Rate-Memory-Compatible Spatially-Coupled Codes","display_name":"Adapt or Regress: Rate-Memory-Compatible Spatially-Coupled Codes","publication_year":2025,"publication_date":"2025-09-25","ids":{"openalex":"https://openalex.org/W7083465604","doi":"https://doi.org/10.48550/arxiv.2509.21112"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2509.21112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.21112","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2509.21112","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Aksoy, Bade","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aksoy, Bade","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"\u00d6zbayrak, Do\u011fukan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00d6zbayrak, Do\u011fukan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hareedy, Ahmed","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hareedy, Ahmed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":true,"primary_topic":{"id":"https://openalex.org/T10195","display_name":"Antimicrobial Resistance in Staphylococcus","score":0.9595000147819519,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10195","display_name":"Antimicrobial Resistance in Staphylococcus","score":0.9595000147819519,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T11000","display_name":"Infection Control in Healthcare","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12526","display_name":"Antimicrobial agents and applications","score":0.00930000003427267,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4821000099182129},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4702000021934509},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.4415000081062317},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.43959999084472656},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4300000071525574},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4032000005245209},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4016999900341034},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.39649999141693115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6951000094413757},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4821000099182129},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4702000021934509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4595000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4462999999523163},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.4415000081062317},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.43959999084472656},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4300000071525574},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4016999900341034},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.39649999141693115},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3930000066757202},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.3732999861240387},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.33469998836517334},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.3077999949455261},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.29109999537467957},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.2842999994754791},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.2831999957561493},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.2709999978542328},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C57890076","wikidata":"https://www.wikidata.org/wiki/Q4680725","display_name":"Adaptive coding","level":4,"score":0.26840001344680786},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.26159998774528503},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2509.21112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.21112","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,"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2509.21112","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.21112","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,"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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5825712084770203}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spatially-coupled":[0],"(SC)":[1],"codes":[2,10,80,116,132,145,217,267],"are":[3,56],"a":[4,30,111,164,193,236,270],"class":[5,112],"of":[6,19,37,113,155,166,198,215],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"that":[11,243],"have":[12],"excellent":[13],"performance":[14,262],"thanks":[15],"to":[16,96,191,211,223,226,246],"the":[17,35,40,49,85,137,144,152,159,167,172,179,183,188,202,232,248],"degrees":[18],"freedom":[20],"they":[21],"offer.":[22],"An":[23],"SC":[24,115,119,138,160,174,216],"code":[25,41,89,95,139,161,175],"is":[26,133],"designed":[27],"by":[28,265],"partitioning":[29],"base":[31],"matrix":[32],"into":[33],"components,":[34],"number":[36,154,214],"which":[38,122,141],"implies":[39],"memory,":[42,140],"then":[43],"coupling":[44],"and":[45,68,76,147,219,260],"lifting":[46],"them.":[47],"In":[48,74,106,126],"same":[50],"system,":[51],"various":[52],"error-correction":[53],"coding":[54],"schemes":[55],"typically":[57],"needed.":[58],"For":[59],"example,":[60],"in":[61,130,158,196,257],"wireless":[62],"communication":[63],"standards,":[64],"several":[65],"channel":[66],"conditions":[67],"data":[69],"rates":[70],"should":[71,81],"be":[72,82,208],"supported.":[73],"storage":[75],"computing":[77],"systems,":[78],"stronger":[79],"adopted":[83],"as":[84,163,176,178],"device":[86],"ages.":[87],"Adaptive":[88],"design":[90,124,212,247],"enables":[91],"switching":[92],"from":[93],"one":[94],"another":[97],"when":[98],"needed,":[99,218],"ensuring":[100],"reliability":[101],"while":[102],"reducing":[103],"hardware":[104],"cost.":[105],"this":[107],"paper,":[108],"we":[109,123,220,230,244],"introduce":[110],"reconfigurable":[114],"named":[117],"rate-memory-compatible":[118],"(RMC-SC)":[120],"codes,":[121],"probabilistically.":[125],"particular,":[127],"rate":[128],"compatibility":[129],"RMC-SC":[131,250,266],"achieved":[134,264],"via":[135],"increasing":[136],"also":[142],"makes":[143],"memory-compatible":[146],"improves":[148],"performance.":[149],"We":[150,186],"express":[151],"expected":[153],"short":[156],"cycles":[157],"protograph":[162],"function":[165],"fixed":[168],"probability":[169],"distribution":[170,181],"characterizing":[171,182],"already-designed":[173],"well":[177],"unknown":[180],"additional":[184],"components.":[185,204],"use":[187],"gradient-descent":[189],"algorithm":[190],"find":[192],"locally-optimal":[194],"distribution,":[195],"terms":[197],"cycle":[199,258],"count,":[200],"for":[201],"new":[203],"The":[205],"method":[206],"can":[207],"recursively":[209],"used":[210],"any":[213],"show":[221],"how":[222],"extend":[224],"it":[225],"other":[227],"cases.":[228],"Next,":[229],"perform":[231],"finite-length":[233],"optimization":[234],"using":[235],"Markov":[237],"chain":[238],"Monte":[239],"Carlo":[240],"(MC$^2$)":[241],"approach":[242],"update":[245],"proposed":[249],"codes.":[251],"Experimental":[252],"results":[253],"demonstrate":[254],"significant":[255],"reductions":[256],"counts":[259],"remarkable":[261],"gains":[263],"compared":[268],"with":[269],"literature-based":[271],"straightforward":[272],"scheme.":[273]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}