{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B7WZGKH6S2AZ4Q4DW3F5VXT6H6","short_pith_number":"pith:B7WZGKH6","schema_version":"1.0","canonical_sha256":"0fed9328fe96819e4383b6cbdade7e3f83739c6aac3abeeb5b0c2fbd2a32f195","source":{"kind":"arxiv","id":"1411.4373","version":1},"attestation_state":"computed","paper":{"title":"Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Lai Wei, Thomas E. Fuja","submitted_at":"2014-11-17T05:57:40Z","abstract_excerpt":"In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative belief propagation (BP) decoding thresholds, with particular emphasis on low-latency windowed decoding (WD). We consider transmission over both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC) and present results for a variety of $(J,K)$-regular SC-LDPC code ensembles constructed over GF$(q)$ using protographs"},"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":"1411.4373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T05:57:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36559ad6ccfe09ed75210c43fd33ac0186d4b9e739dbf71ef9a33b9ff884a21a","abstract_canon_sha256":"45c2c565b4cf331fd8dd6aaca1fe4f7a9327d9f69ab2da9061a21a8c95e082b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.833433Z","signature_b64":"mjvVSOQ39VekyyJwaokotDrlrQAV4QO8RJQvUAqt7cEc3/XIMxRDOZOnz26T/R/KDwBTxXanT1+0m3IJX3/5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fed9328fe96819e4383b6cbdade7e3f83739c6aac3abeeb5b0c2fbd2a32f195","last_reissued_at":"2026-05-18T02:35:45.832998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.832998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Lai Wei, Thomas E. Fuja","submitted_at":"2014-11-17T05:57:40Z","abstract_excerpt":"In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative belief propagation (BP) decoding thresholds, with particular emphasis on low-latency windowed decoding (WD). We consider transmission over both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC) and present results for a variety of $(J,K)$-regular SC-LDPC code ensembles constructed over GF$(q)$ using protographs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4373","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":"1411.4373","created_at":"2026-05-18T02:35:45.833065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4373v1","created_at":"2026-05-18T02:35:45.833065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4373","created_at":"2026-05-18T02:35:45.833065+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7WZGKH6S2AZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7WZGKH6S2AZ4Q4D","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7WZGKH6","created_at":"2026-05-18T12:28:22.404517+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/B7WZGKH6S2AZ4Q4DW3F5VXT6H6","json":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6.json","graph_json":"https://pith.science/api/pith-number/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/graph.json","events_json":"https://pith.science/api/pith-number/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/events.json","paper":"https://pith.science/paper/B7WZGKH6"},"agent_actions":{"view_html":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6","download_json":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6.json","view_paper":"https://pith.science/paper/B7WZGKH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4373&json=true","fetch_graph":"https://pith.science/api/pith-number/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/graph.json","fetch_events":"https://pith.science/api/pith-number/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/action/storage_attestation","attest_author":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/action/author_attestation","sign_citation":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/action/citation_signature","submit_replication":"https://pith.science/pith/B7WZGKH6S2AZ4Q4DW3F5VXT6H6/action/replication_record"}},"created_at":"2026-05-18T02:35:45.833065+00:00","updated_at":"2026-05-18T02:35:45.833065+00:00"}