{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NIOA3RNMVPP5N47DLOXAI7OFF4","short_pith_number":"pith:NIOA3RNM","schema_version":"1.0","canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","source":{"kind":"arxiv","id":"1810.01137","version":1},"attestation_state":"computed","paper":{"title":"Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kevin Klaiber, Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2018-10-02T09:35:56Z","abstract_excerpt":"In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation (BP) decoding. However, a drawback of windowed decoding is that either a significant amount of window updates are required leading to unnecessary high decoding complexity or the decoder suffers from sporadic burst-like error patterns, causing a decoder stall. To tackle this effect and, thus, to reduce the average decoding complexity, the basic idea is to enab"},"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":"1810.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-02T09:35:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0132a24814da98c4d37932d67c33fe0cb4aa7d236562bed18919b33eeb7ce89b","abstract_canon_sha256":"0a85f97e47b030875ae81981f481fbdc18fa89891e5b0b2658f2dcd0c03baaaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:18.703561Z","signature_b64":"fhGBTodD7YbH/gleVXtY+44Qw1NL8vnbOLiD0shd0j/D7JpRt9hFHeJqazODAObmpk5eMiFeWZHGk25X4U9pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a1c0dc5acabdfd6f3e35bae047dc52f3381c9b14be4caeb776b4ec3e3e5a802","last_reissued_at":"2026-05-18T00:04:18.702850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:18.702850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kevin Klaiber, Laurent Schmalen, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2018-10-02T09:35:56Z","abstract_excerpt":"In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation (BP) decoding. However, a drawback of windowed decoding is that either a significant amount of window updates are required leading to unnecessary high decoding complexity or the decoder suffers from sporadic burst-like error patterns, causing a decoder stall. To tackle this effect and, thus, to reduce the average decoding complexity, the basic idea is to enab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01137","kind":"arxiv","version":1},"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":"1810.01137","created_at":"2026-05-18T00:04:18.702955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01137v1","created_at":"2026-05-18T00:04:18.702955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01137","created_at":"2026-05-18T00:04:18.702955+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIOA3RNMVPP5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIOA3RNMVPP5N47D","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIOA3RNM","created_at":"2026-05-18T12:32:40.477152+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/NIOA3RNMVPP5N47DLOXAI7OFF4","json":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4.json","graph_json":"https://pith.science/api/pith-number/NIOA3RNMVPP5N47DLOXAI7OFF4/graph.json","events_json":"https://pith.science/api/pith-number/NIOA3RNMVPP5N47DLOXAI7OFF4/events.json","paper":"https://pith.science/paper/NIOA3RNM"},"agent_actions":{"view_html":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4","download_json":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4.json","view_paper":"https://pith.science/paper/NIOA3RNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01137&json=true","fetch_graph":"https://pith.science/api/pith-number/NIOA3RNMVPP5N47DLOXAI7OFF4/graph.json","fetch_events":"https://pith.science/api/pith-number/NIOA3RNMVPP5N47DLOXAI7OFF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/action/storage_attestation","attest_author":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/action/author_attestation","sign_citation":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/action/citation_signature","submit_replication":"https://pith.science/pith/NIOA3RNMVPP5N47DLOXAI7OFF4/action/replication_record"}},"created_at":"2026-05-18T00:04:18.702955+00:00","updated_at":"2026-05-18T00:04:18.702955+00:00"}