{"id":"https://openalex.org/W2933612003","doi":"https://doi.org/10.1109/tit.2020.2979981","title":"A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes","display_name":"A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes","publication_year":2020,"publication_date":"2020-03-11","ids":{"openalex":"https://openalex.org/W2933612003","doi":"https://doi.org/10.1109/tit.2020.2979981","mag":"2933612003"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2020.2979981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.2979981","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1804.05504","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ahmed Hareedy","orcid":"https://orcid.org/0000-0002-8523-6754"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]},{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed Hareedy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, USA","Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0002-8523-6754","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ruiyi Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruiyi Wu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":null,"display_name":"Lara Dolecek","orcid":"https://orcid.org/0000-0003-3736-4345"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lara Dolecek","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0003-3736-4345","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Los Angeles (UCLA), Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2045,"currency":"USD","value_usd":2045},"apc_paid":null,"fwci":1.5604,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86379338,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"8","first_page":"4834","last_page":"4852"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.5479999780654907,"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"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.5479999780654907,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.23000000417232513,"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.1573999971151352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6504999995231628},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5214999914169312},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5210000276565552},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4584999978542328},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4440000057220459},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.4230000078678131},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.41510000824928284},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4142000079154968},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4016999900341034},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.3792000114917755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6822999715805054},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6504999995231628},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5214999914169312},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4733999967575073},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4584999978542328},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.4230000078678131},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.41510000824928284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.414900004863739},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4142000079154968},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4016999900341034},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.3792000114917755},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.375},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.35989999771118164},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3301999866962433},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.32420000433921814},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.31700000166893005},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.30880001187324524},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.3082999885082245},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.30640000104904175},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.27900001406669617},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.2734000086784363},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27250000834465027},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.26660001277923584},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.2660999894142151},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2020.2979981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.2979981","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1804.05504","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.05504","pdf_url":"https://arxiv.org/pdf/1804.05504","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:https://open.metu.edu.tr:11511/98540","is_oa":false,"landing_page_url":"https://hdl.handle.net/11511/98540","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"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":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1804.05504","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.05504","pdf_url":"https://arxiv.org/pdf/1804.05504","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2057789657","display_name":"CCF-BSF:CIF: Small: Coding for Fast Storage Access and In-Memory  Computing","funder_award_id":"1718389","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332502","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1577660440","https://openalex.org/W1732027798","https://openalex.org/W1864365761","https://openalex.org/W1972036717","https://openalex.org/W1973712217","https://openalex.org/W1979520705","https://openalex.org/W1991528082","https://openalex.org/W2045407304","https://openalex.org/W2109866575","https://openalex.org/W2116340504","https://openalex.org/W2123119950","https://openalex.org/W2137039008","https://openalex.org/W2145359430","https://openalex.org/W2150368154","https://openalex.org/W2154756387","https://openalex.org/W2158514560","https://openalex.org/W2170998175","https://openalex.org/W2179644698","https://openalex.org/W2201739330","https://openalex.org/W2282708552","https://openalex.org/W2319284140","https://openalex.org/W2417030859","https://openalex.org/W2511387816","https://openalex.org/W2519093122","https://openalex.org/W2613440375","https://openalex.org/W2616796307","https://openalex.org/W2660253127","https://openalex.org/W2690179980","https://openalex.org/W2743484031","https://openalex.org/W2744736268","https://openalex.org/W2803997320","https://openalex.org/W2898915249","https://openalex.org/W2962883682","https://openalex.org/W2963227765","https://openalex.org/W6929072781"],"related_works":[],"abstract_inverted_index":{"Because":[0],"of":[1,83,96,103,124,130,138,141,196,204,209,222,228,253,276,288,300,312],"their":[2,6],"capacity-approaching":[3],"performance":[4,64,102,172,298],"and":[5,37,73,191,260,280,292],"complexity/latency":[7],"advantages,":[8],"spatially-coupled":[9],"(SC)":[10],"codes":[11,18,28,66,105,150,174,232,246,271,275,302,311],"are":[12,29],"among":[13],"the":[14,39,50,81,84,89,94,101,110,113,122,128,136,139,144,193,197,202,207,215,220,226,229,235,277,305,313,321,328],"most":[15],"attractive":[16],"error-correcting":[17],"for":[19,67,151,175,239],"use":[20],"in":[21,127,206,225,255,263,290,295,320,327],"modern":[22],"dense":[23],"data":[24],"storage":[25],"systems.":[26],"SC":[27,47,65,85,104,149,173,231,245,270,301],"constructed":[30],"by":[31,247,282],"partitioning":[32,91],"an":[33],"underlying":[34],"block":[35,274,310],"code":[36,86,132],"coupling":[38],"partitioned":[40],"components.":[41],"Here,":[42],"we":[43,164,169,188,213],"focus":[44],"on":[45,80,135,201],"circulant-based":[46],"codes.":[48],"Recently,":[49],"optimal":[51,90],"overlap":[52],"(OO),":[53],"circulant":[54,114],"power":[55],"optimizer":[56],"(CPO)":[57],"approach":[58,146,238,308],"was":[59],"introduced":[60],"to":[61,87,116,147,217,249,284],"construct":[62,148,170],"high":[63,171],"additive":[68],"white":[69],"Gaussian":[70],"noise":[71],"(AWGN)":[72],"Flash":[74],"channels.":[75,184,211],"The":[76,297],"OO":[77,198],"stage":[78],"operates":[79],"protograph":[82],"derive":[88],"that":[92,99],"minimizes":[93],"number":[95,221],"graphical":[97],"objects":[98,126,203,224],"undermine":[100],"under":[106],"iterative":[107],"decoding.":[108],"Then,":[109,212],"CPO":[111,216],"optimizes":[112],"powers":[115],"further":[117,218],"reduce":[118,219],"this":[119,162],"number.":[120],"Since":[121],"nature":[123],"detrimental":[125],"graph":[129,227],"a":[131,158],"critically":[133],"depends":[134],"characteristics":[137],"channel":[140],"interest,":[142],"extending":[143],"OO-CPO":[145,237,307],"channels":[152,241],"with":[153],"intrinsic":[154],"memory":[155],"is":[156,316],"not":[157,317],"straightforward":[159],"task.":[160],"In":[161],"paper,":[163],"tackle":[165],"one":[166],"relevant":[167],"extension;":[168],"practical":[176],"1-D":[177],"magnetic":[178],"recording":[179],"channels,":[180],"i.e.,":[181],"partial-response":[182],"(PR)":[183],"Via":[185],"combinatorial":[186],"techniques,":[187],"carefully":[189],"build":[190],"solve":[192],"optimization":[194],"problem":[195],"partitioning,":[199],"focusing":[200],"interest":[205],"case":[208],"PR":[210,240],"customize":[214],"these":[223],"code.":[230],"designed":[233,303],"using":[234,304],"proposed":[236],"outperform":[242,272],"prior":[243],"state-of-the-art":[244],"up":[248,283],"around":[250,285],"3":[251],"orders":[252,287],"magnitude":[254,289],"frame":[256],"error":[257,322],"rate":[258,281],"(FER)":[259],"1.1":[261],"dB":[262,294],"signal-to-noise":[264],"ratio":[265],"(SNR).":[266],"More":[267],"intriguingly,":[268],"our":[269],"structured":[273],"same":[278,314],"length":[279],"1.8":[286],"FER":[291],"0.4":[293],"SNR.":[296],"advantage":[299],"devised":[306],"over":[309],"parameters":[315],"only":[318],"pronounced":[319],"floor":[323],"region,":[324],"but":[325],"also":[326],"waterfall":[329],"region.":[330]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2019-04-11T00:00:00"}