{"id":"https://openalex.org/W1926965170","doi":"https://doi.org/10.1109/itwf.2015.7360749","title":"Analysis of spatially-coupled counter braids","display_name":"Analysis of spatially-coupled counter braids","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W1926965170","doi":"https://doi.org/10.1109/itwf.2015.7360749","mag":"1926965170"},"language":"en","primary_location":{"id":"doi:10.1109/itwf.2015.7360749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwf.2015.7360749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Information Theory Workshop - Fall (ITW)","raw_type":"proceedings-article"},"type":"article","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/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]},{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Department of Informatics, Simula Research Lab, Bergen, Norway","Department of Informatics, University of Bergen, N-5020, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Simula Research Lab, Bergen, Norway","institution_ids":["https://openalex.org/I2799829267"]},{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014522913","display_name":"Alexandre Graell i Amat","orcid":"https://orcid.org/0000-0002-5725-869X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Alexandre Graell i Amat","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","Department of Signals and Systems, Chalmers University of Technology, SE 412\u201096, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, SE 412\u201096, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06458822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9828000068664551,"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.9828000068664551,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9648000001907349,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.7179712653160095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6362440586090088},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.6121534109115601},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5382570624351501},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5251640677452087},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.44937729835510254},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42170554399490356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4041309952735901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3891676664352417},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34228551387786865},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17091652750968933},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08621916174888611}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7179712653160095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6362440586090088},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.6121534109115601},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5382570624351501},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5251640677452087},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.44937729835510254},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42170554399490356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4041309952735901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3891676664352417},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34228551387786865},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17091652750968933},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08621916174888611},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itwf.2015.7360749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwf.2015.7360749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Information Theory Workshop - Fall (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:219651","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/219651","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1603473954","https://openalex.org/W1965559626","https://openalex.org/W1969203013","https://openalex.org/W2059739152","https://openalex.org/W2172679141","https://openalex.org/W2546166905","https://openalex.org/W2952834582","https://openalex.org/W3099384592","https://openalex.org/W3125530803","https://openalex.org/W4292232932"],"related_works":["https://openalex.org/W4307680413","https://openalex.org/W2963817320","https://openalex.org/W2493667298","https://openalex.org/W2101147641","https://openalex.org/W3080746295","https://openalex.org/W2356695932","https://openalex.org/W2521082822","https://openalex.org/W2511191118","https://openalex.org/W4317438041","https://openalex.org/W4311940391"],"abstract_inverted_index":{"A":[0],"counter":[1,7],"braid":[2],"(CB)":[3],"is":[4,119,148],"a":[5,110,159,165],"novel":[6],"architecture":[8],"introduced":[9],"by":[10],"Lu":[11],"et":[12],"al.":[13],"in":[14,149],"2007":[15],"for":[16,98,103],"per-flow":[17],"measurements":[18],"on":[19,162,196],"high-speed":[20],"links.":[21],"CBs":[22,43,56],"achieve":[23],"an":[24,60,133],"asymptotic":[25,134],"compression":[26],"rate":[27],"(under":[28],"optimal":[29],"decoding)":[30],"that":[31,73,84,144],"matches":[32],"the":[33,38,74,85,88,99,104,115,125,137,142,145,153,163,181,185,192,197],"entropy":[34],"lower":[35,160,194],"bound":[36,161,195],"of":[37,65,136,184,189],"flow":[39],"size":[40],"distribution.":[41],"Spatially-coupled":[42],"(SC-CBs)":[44],"have":[45],"recently":[46],"been":[47],"proposed.":[48],"In":[49],"this":[50,68],"work,":[51],"we":[52,71,171],"further":[53],"analyze":[54],"single-layer":[55],"and":[57,76,132,157,176],"SC-CBs":[58,190],"using":[59],"equivalent":[61,69,100,113],"bipartite":[62],"graph":[63,108],"representation":[64],"CBs.":[66],"On":[67],"representation,":[70],"show":[72,83],"potential":[75],"area":[77,86,126,146],"thresholds":[78],"are":[79],"equal.":[80],"We":[81],"also":[82],"under":[87],"extended":[89],"belief":[90],"propagation":[91],"(BP)":[92],"extrinsic":[93],"information":[94],"transfer":[95],"curve":[96],"(defined":[97],"graph),":[101],"computed":[102],"expected":[105],"residual":[106],"CB":[107],"when":[109],"peeling":[111],"decoder":[112,117],"to":[114,121,141,152,191],"BP":[116,186],"stops,":[118],"equal":[120,151],"zero":[122],"precisely":[123],"at":[124],"threshold.":[127,169,200],"This,":[128],"combined":[129],"with":[130],"simulations":[131],"analysis":[135],"Maxwell":[138,154],"decoder,":[139],"leads":[140],"conjecture":[143],"threshold":[147,156,188],"fact":[150],"decoding":[155,168,187,199],"hence":[158],"maximum":[164],"posteriori":[166],"(MAP)":[167],"Finally,":[170],"present":[172],"some":[173,178],"numerical":[174],"results":[175],"give":[177],"insight":[179],"into":[180],"apparent":[182],"gap":[183],"conjectured":[193],"MAP":[198]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}