{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q2VHNXRWGEXBYOFGT4N4FG4K2A","short_pith_number":"pith:Q2VHNXRW","schema_version":"1.0","canonical_sha256":"86aa76de36312e1c38a69f1bc29b8ad00c12f9389beeb741fea9ecf24d13258d","source":{"kind":"arxiv","id":"1408.2621","version":1},"attestation_state":"computed","paper":{"title":"Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Kechao Huang, Lai Wei, Xiao Ma","submitted_at":"2014-08-12T05:18:31Z","abstract_excerpt":"In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one when the constraint length of q-ary SC-LDPC codes is equal to the block length of q-ary LDPC-BCs and the other when the two decoding latencies are equal. Simulation results confirm that, in both regimes,"},"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":"1408.2621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T05:18:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7860821c365b11cc36c89fa94f8cc7e16dc9a92aef3e3681f86478056f91381","abstract_canon_sha256":"252c6d711bfc481476f988a0256f76f2e4a693f83c3a4dee11f76c9b48543bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.668255Z","signature_b64":"OhAqTlqLt7mBECrU8kYCAo63pjCST8bkk77pR5StgootHkPA9lR9/vchvCAQ+MkVQel4kGhrh3Wv91VHGWCaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86aa76de36312e1c38a69f1bc29b8ad00c12f9389beeb741fea9ecf24d13258d","last_reissued_at":"2026-05-18T02:45:22.667845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.667845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Kechao Huang, Lai Wei, Xiao Ma","submitted_at":"2014-08-12T05:18:31Z","abstract_excerpt":"In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one when the constraint length of q-ary SC-LDPC codes is equal to the block length of q-ary LDPC-BCs and the other when the two decoding latencies are equal. Simulation results confirm that, in both regimes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2621","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":"1408.2621","created_at":"2026-05-18T02:45:22.667903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2621v1","created_at":"2026-05-18T02:45:22.667903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2621","created_at":"2026-05-18T02:45:22.667903+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2VHNXRWGEXB","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2VHNXRWGEXBYOFG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2VHNXRW","created_at":"2026-05-18T12:28:43.426989+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/Q2VHNXRWGEXBYOFGT4N4FG4K2A","json":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A.json","graph_json":"https://pith.science/api/pith-number/Q2VHNXRWGEXBYOFGT4N4FG4K2A/graph.json","events_json":"https://pith.science/api/pith-number/Q2VHNXRWGEXBYOFGT4N4FG4K2A/events.json","paper":"https://pith.science/paper/Q2VHNXRW"},"agent_actions":{"view_html":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A","download_json":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A.json","view_paper":"https://pith.science/paper/Q2VHNXRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2621&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2VHNXRWGEXBYOFGT4N4FG4K2A/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2VHNXRWGEXBYOFGT4N4FG4K2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A/action/storage_attestation","attest_author":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A/action/author_attestation","sign_citation":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A/action/citation_signature","submit_replication":"https://pith.science/pith/Q2VHNXRWGEXBYOFGT4N4FG4K2A/action/replication_record"}},"created_at":"2026-05-18T02:45:22.667903+00:00","updated_at":"2026-05-18T02:45:22.667903+00:00"}