{"id":"https://openalex.org/W2744736268","doi":"https://doi.org/10.1109/isit.2017.8006818","title":"A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning","display_name":"A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2744736268","doi":"https://doi.org/10.1109/isit.2017.8006818","mag":"2744736268"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010743882","display_name":"Homa Esfahanizadeh","orcid":"https://orcid.org/0000-0003-1217-692X"},"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":"Homa Esfahanizadeh","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066643381","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed Hareedy","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075795132","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 Engineering, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":3.1473,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93340249,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1693","last_page":"1697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9940999746322632,"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/computer-science","display_name":"Computer science","score":0.6664596796035767},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6451306343078613},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.6302803158760071},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.589156448841095},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.546948254108429},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5254953503608704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44119447469711304},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43779557943344116},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4367341995239258},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41895899176597595},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4073020815849304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2956075072288513},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2643704116344452},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17634347081184387},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14910119771957397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6664596796035767},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6451306343078613},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.6302803158760071},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.589156448841095},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.546948254108429},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5254953503608704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44119447469711304},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43779557943344116},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4367341995239258},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41895899176597595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4073020815849304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2956075072288513},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2643704116344452},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17634347081184387},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14910119771957397},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8006818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:https://open.metu.edu.tr:11511/98243","is_oa":false,"landing_page_url":"https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85034099961&origin=inward","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":"2017 IEEE International Symposium on Information Theory, ISIT 2017","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1732027798","https://openalex.org/W1985001547","https://openalex.org/W1991528082","https://openalex.org/W2071304218","https://openalex.org/W2123119950","https://openalex.org/W2150368154","https://openalex.org/W2170998175","https://openalex.org/W2172679141","https://openalex.org/W2501717114","https://openalex.org/W2519093122","https://openalex.org/W2744736268","https://openalex.org/W3098829249","https://openalex.org/W3125530803"],"related_works":["https://openalex.org/W2040891617","https://openalex.org/W1789154498","https://openalex.org/W1577824376","https://openalex.org/W3008714642","https://openalex.org/W2886235473","https://openalex.org/W1589560372","https://openalex.org/W2368550159","https://openalex.org/W2354854546","https://openalex.org/W2798929736","https://openalex.org/W1922446387"],"abstract_inverted_index":{"Spatially-coupled":[0],"(SC)":[1],"codes":[2,8,172],"are":[3],"a":[4,32,56,67,84,108],"family":[5],"of":[6,34,43,90,110,134,151,162],"graph-based":[7],"that":[9,77,97],"have":[10],"attracted":[11],"significant":[12],"attention":[13],"thanks":[14],"to":[15,101,107,114],"their":[16,38],"capacity":[17],"approaching":[18],"performance.":[19],"An":[20],"SC":[21,63,104,120,171],"code":[22,30,105,121],"is":[23,45],"constructed":[24,122],"by":[25,47,123,156],"partitioning":[26,69,111,152],"an":[27,119,160],"underlying":[28],"block":[29,117],"into":[31],"number":[33,42],"components,":[35],"and":[36,106,131,142],"coupling":[37],"copies":[39],"together.":[40],"The":[41],"components":[44],"determined":[46],"the":[48,61,88,94,115,124,139,148],"memory":[49,140],"parameter.":[50],"In":[51],"this":[52,164],"paper,":[53],"we":[54,72],"study":[55],"finite":[57],"length":[58],"construction":[59],"for":[60,87,138,170],"circulant-based":[62,103],"codes.":[64],"We":[65,81],"introduce":[66],"new":[68,125],"scheme,":[70],"which":[71],"call":[73],"minimum":[74],"overlap":[75],"partitioning,":[76],"outperforms":[78,147],"previous":[79],"methods.":[80],"also":[82],"present":[83],"general":[85],"approach":[86,126],"enumeration":[89],"problematic":[91],"objects":[92],"in":[93],"error-floor":[95],"regime":[96],"can":[98],"be":[99],"applied":[100],"any":[102],"variety":[109],"schemes.":[112],"Compared":[113],"uncoupled":[116],"codes,":[118],"has":[127],"more":[128,168],"than":[129],"1.5":[130],"3":[132],"orders":[133],"magnitude":[135],"performance":[136,165],"improvement":[137],"1":[141],"2,":[143],"respectively.":[144],"Additionally,":[145],"it":[146],"existing":[149],"method":[150],"via":[153],"cutting":[154],"vectors":[155],"at":[157],"least":[158],"half":[159],"order":[161],"magnitude;":[163],"advantage":[166],"becomes":[167],"pronounced":[169],"with":[173],"higher":[174],"memories.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}