{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OFBFPRUCCMVK7HAFFNHE27W3X6","short_pith_number":"pith:OFBFPRUC","schema_version":"1.0","canonical_sha256":"714257c682132aaf9c052b4e4d7edbbfa02b1d2052a9e7a05c11d3d1bf59f428","source":{"kind":"arxiv","id":"1604.07315","version":2},"attestation_state":"computed","paper":{"title":"Spatially Coupled Turbo-Like Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Michael Lentmaier, Saeedeh Moloudi","submitted_at":"2016-04-25T15:48:34Z","abstract_excerpt":"In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of Berrou et al. parallel concatenated codes (PCCs) and Benedetto et al. serially concatenated codes (SCCs). Furthermore, we propose two extensions of braided convolutional codes (BCCs), a class of turbo-like codes which have an inherent spatially coupled structure, to higher coupling memories, and show that these yield improved belief propagation (BP) thresholds as compared to the original BCC e"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.07315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T15:48:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"daec369e039760fcf3b16dd539bfff63928ca3ee9260c266f0d6edd3d5bd9a30","abstract_canon_sha256":"9f3b727348f939c4400952825c8057a388ece0fd55e271182a2abda73f053df2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:00.034633Z","signature_b64":"WrdB4oszklyB+VGWIlBsWQBXCSTF376NgaSxj72OJmt88RprEcVFR9d2AlSdUEt0TM2Qsm/9dOm7tZYVBujIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714257c682132aaf9c052b4e4d7edbbfa02b1d2052a9e7a05c11d3d1bf59f428","last_reissued_at":"2026-05-18T00:34:00.034036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:00.034036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially Coupled Turbo-Like Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Michael Lentmaier, Saeedeh Moloudi","submitted_at":"2016-04-25T15:48:34Z","abstract_excerpt":"In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of Berrou et al. parallel concatenated codes (PCCs) and Benedetto et al. serially concatenated codes (SCCs). Furthermore, we propose two extensions of braided convolutional codes (BCCs), a class of turbo-like codes which have an inherent spatially coupled structure, to higher coupling memories, and show that these yield improved belief propagation (BP) thresholds as compared to the original BCC e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07315","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.07315","created_at":"2026-05-18T00:34:00.034121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07315v2","created_at":"2026-05-18T00:34:00.034121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07315","created_at":"2026-05-18T00:34:00.034121+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFBFPRUCCMVK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFBFPRUCCMVK7HAF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFBFPRUC","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6","json":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6.json","graph_json":"https://pith.science/api/pith-number/OFBFPRUCCMVK7HAFFNHE27W3X6/graph.json","events_json":"https://pith.science/api/pith-number/OFBFPRUCCMVK7HAFFNHE27W3X6/events.json","paper":"https://pith.science/paper/OFBFPRUC"},"agent_actions":{"view_html":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6","download_json":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6.json","view_paper":"https://pith.science/paper/OFBFPRUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07315&json=true","fetch_graph":"https://pith.science/api/pith-number/OFBFPRUCCMVK7HAFFNHE27W3X6/graph.json","fetch_events":"https://pith.science/api/pith-number/OFBFPRUCCMVK7HAFFNHE27W3X6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6/action/storage_attestation","attest_author":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6/action/author_attestation","sign_citation":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6/action/citation_signature","submit_replication":"https://pith.science/pith/OFBFPRUCCMVK7HAFFNHE27W3X6/action/replication_record"}},"created_at":"2026-05-18T00:34:00.034121+00:00","updated_at":"2026-05-18T00:34:00.034121+00:00"}