{"id":"https://openalex.org/W7143542390","doi":"https://doi.org/10.48550/arxiv.2603.25824","title":"Exploiting the Degrees of Freedom: Multi-Dimensional Spatially-Coupled Codes Based on Gradient Descent","display_name":"Exploiting the Degrees of Freedom: Multi-Dimensional Spatially-Coupled Codes Based on Gradient Descent","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7143542390","doi":"https://doi.org/10.48550/arxiv.2603.25824"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.25824","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25824","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.2603.25824","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113109524","display_name":"Ata Tanr\u0131kulu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tanr\u0131kulu, Ata","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082160356","display_name":"Mete Y\u0131ld\u0131r\u0131m","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y\u0131ld\u0131r\u0131m, Mete","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066643381","display_name":"Ahmed Hareedy","orcid":"https://orcid.org/0000-0002-8523-6754"},"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":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.7635999917984009,"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.7635999917984009,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.20489999651908875,"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.003100000089034438,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5730999708175659},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5411999821662903},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4733000099658966},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.37220001220703125},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.36070001125335693},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.36000001430511475},{"id":"https://openalex.org/keywords/matrix-representation","display_name":"Matrix representation","score":0.35519999265670776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3492000102996826},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.34769999980926514}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6391000151634216},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5730999708175659},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5577999949455261},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5411999821662903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48170000314712524},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4733000099658966},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.36070001125335693},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.35519999265670776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.34769999980926514},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.29409998655319214},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.290800005197525},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.27160000801086426},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.2705000042915344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26910001039505005},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C208081375","wikidata":"https://www.wikidata.org/wiki/Q274502","display_name":"Degrees of freedom (physics and chemistry)","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.25824","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25824","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.2603.25824","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25824","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":[{"score":0.8160049319267273,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spatially-coupled":[0],"(SC)":[1],"codes":[2,10,19,100,262,272],"are":[3,20],"a":[4,81,133,145,169,275],"class":[5],"of":[6,25,37,51,53,68,72,113,125,130,132,155,194,247],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"that":[11,136,161,179,235,259],"is":[12,104,180],"gaining":[13],"increasing":[14],"attention.":[15],"Multi-dimensional":[16],"(MD)":[17],"SC":[18,27],"constructed":[21],"by":[22,182,274],"connecting":[23],"copies":[24],"an":[26],"code":[28,58,87,127,140],"via":[29],"relocations":[30],"in":[31,42,55,121,128,266],"order":[32],"to":[33,95,119,191,208],"mitigate":[34],"various":[35,192],"sources":[36],"non-uniformity":[38],"and":[39,45,202],"improve":[40],"performance":[41,98,268],"many":[43],"storage":[44],"transmission":[46],"systems.":[47],"As":[48],"the":[49,56,69,73,85,91,110,122,126,138,152,156,163,183,206,220,226,253],"number":[50,112],"degrees":[52],"freedom":[54],"MD-SC":[57,86,139,165,271],"design":[59,74,96,227],"increases,":[60],"appropriately":[61],"exploiting":[62],"them":[63],"becomes":[64],"more":[65,210],"difficult":[66],"because":[67],"complexity":[70],"growth":[71],"process.":[75],"In":[76,106],"this":[77,102],"paper,":[78],"we":[79,108,117,204,230,257],"propose":[80],"probabilistic":[82],"framework":[83,190,207],"for":[84],"design,":[88],"based":[89],"on":[90],"gradient-descent":[92],"(GD)":[93],"algorithm,":[94],"high":[97],"MD":[99,237],"where":[101],"challenge":[103],"addressed.":[105],"particular,":[107],"express":[109],"expected":[111],"detrimental":[114,249],"objects,":[115],"which":[116,149],"seek":[118],"minimize,":[120],"graph":[123],"representation":[124],"terms":[129],"entries":[131],"probability-distribution":[134],"matrix":[135],"characterizes":[137],"design.":[141],"We":[142,167,187,196,218],"then":[143,203],"find":[144],"locally-optimal":[146],"probability":[147],"distribution,":[148],"serves":[150],"as":[151,223,225],"starting":[153],"point":[154],"finite-length":[157],"(FL)":[158],"algorithmic":[159,177],"optimizer":[160,178],"produces":[162],"final":[164],"code.":[166],"adopt":[168],"recently-introduced":[170],"Markov":[171],"chain":[172],"Monte":[173],"Carlo":[174],"(MCMC)":[175],"FL":[176],"guided":[181],"proposed":[184],"GD":[185],"algorithm.":[186],"apply":[188],"our":[189,236,260],"objects":[193,250],"interest.":[195],"start":[197],"from":[198],"simple":[199],"short":[200],"cycles,":[201],"develop":[205],"address":[209],"sophisticated":[211],"cycle":[212],"concatenations,":[213],"aiming":[214],"at":[215],"finer-grained":[216],"optimization.":[217],"offer":[219],"theoretical":[221],"analysis":[222],"well":[224],"algorithms.":[228],"Next,":[229],"present":[231],"experimental":[232],"results":[233],"demonstrating":[234],"codes,":[238,242],"conveniently":[239],"called":[240],"GD-MD":[241,261],"have":[243],"notably":[244],"lower":[245],"numbers":[246],"targeted":[248],"compared":[251,269],"with":[252,270],"available":[254],"state-of-the-art.":[255],"Moreover,":[256],"show":[258],"exhibit":[263],"significant":[264],"improvements":[265],"error-rate":[267],"obtained":[273],"uniform":[276],"distribution.":[277]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-31T00:00:00"}