{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QNTDZHT6MHA3AUSTCE3DO5QA27","short_pith_number":"pith:QNTDZHT6","schema_version":"1.0","canonical_sha256":"83663c9e7e61c1b052531136377600d7e8ed20d2a35aa7fac916bce9bd949b88","source":{"kind":"arxiv","id":"1507.01970","version":2},"attestation_state":"computed","paper":{"title":"Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink, Vahid Aref","submitted_at":"2015-07-07T21:14:42Z","abstract_excerpt":"Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical finite coupling lengths. In this paper, we study how we can approach the performance of terminated SC-LDPC codes by random shortening of tail-biting SC-LDPC codes. We find the minimum required rate-loss in order to achieve the same performance than terminated codes. We additionally study the use of tail-biting SC-LDPC codes for transmission over parallel channe"},"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":"1507.01970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-07T21:14:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8058717cd7504e83d1c409ae39d6b6f252d81ee955a40e2873f693d547cb7c78","abstract_canon_sha256":"cd2a0e10423e068be6d86f8edb857a7ea779ca065ece2e1a6ac7ff4872e3cb3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:18.801285Z","signature_b64":"EQHym17FhOiTLQHvEmna+tlOZAlipZkUfAtqahZKpV4SmEjEhhlGH5SvXxzLYGs9Wd49j6Hb/YNk6jUPIiotAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83663c9e7e61c1b052531136377600d7e8ed20d2a35aa7fac916bce9bd949b88","last_reissued_at":"2026-05-18T01:24:18.800856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:18.800856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triggering Wave-Like Convergence of Tail-biting Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink, Vahid Aref","submitted_at":"2015-07-07T21:14:42Z","abstract_excerpt":"Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical finite coupling lengths. In this paper, we study how we can approach the performance of terminated SC-LDPC codes by random shortening of tail-biting SC-LDPC codes. We find the minimum required rate-loss in order to achieve the same performance than terminated codes. We additionally study the use of tail-biting SC-LDPC codes for transmission over parallel channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01970","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":"1507.01970","created_at":"2026-05-18T01:24:18.800914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01970v2","created_at":"2026-05-18T01:24:18.800914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01970","created_at":"2026-05-18T01:24:18.800914+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNTDZHT6MHA3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNTDZHT6MHA3AUST","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNTDZHT6","created_at":"2026-05-18T12:29:37.295048+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/QNTDZHT6MHA3AUSTCE3DO5QA27","json":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27.json","graph_json":"https://pith.science/api/pith-number/QNTDZHT6MHA3AUSTCE3DO5QA27/graph.json","events_json":"https://pith.science/api/pith-number/QNTDZHT6MHA3AUSTCE3DO5QA27/events.json","paper":"https://pith.science/paper/QNTDZHT6"},"agent_actions":{"view_html":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27","download_json":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27.json","view_paper":"https://pith.science/paper/QNTDZHT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01970&json=true","fetch_graph":"https://pith.science/api/pith-number/QNTDZHT6MHA3AUSTCE3DO5QA27/graph.json","fetch_events":"https://pith.science/api/pith-number/QNTDZHT6MHA3AUSTCE3DO5QA27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27/action/storage_attestation","attest_author":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27/action/author_attestation","sign_citation":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27/action/citation_signature","submit_replication":"https://pith.science/pith/QNTDZHT6MHA3AUSTCE3DO5QA27/action/replication_record"}},"created_at":"2026-05-18T01:24:18.800914+00:00","updated_at":"2026-05-18T01:24:18.800914+00:00"}