{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V4DZPYPCF33LRNZYNF4L7EQFNF","short_pith_number":"pith:V4DZPYPC","schema_version":"1.0","canonical_sha256":"af0797e1e22ef6b8b7386978bf9205697d27cdf104309d7dfee942f1454951c9","source":{"kind":"arxiv","id":"1209.5762","version":2},"attestation_state":"computed","paper":{"title":"Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Amina Piemontese, Giulio Colavolpe","submitted_at":"2012-09-25T20:53:01Z","abstract_excerpt":"We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient method to derive an upper bound to the maximum a posteriori probability (MAP) threshold for nonbinary LDPC codes, and observe that the MAP performance of regular LDPC codes improves with the alphabet size. We then consider nonbinary SC-LDPC codes. We show that the same threshold saturation effect experienced by binary SC-LDPC codes occurs for the nonbinary codes"},"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":"1209.5762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-25T20:53:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04383c9149037a01d96c5ea4fb8638c0f9a343cfa28f9758fc911f9c6c33a471","abstract_canon_sha256":"74607acd643589364d019ad33a272c310e037c6f1c7daee5e9fbf163e113b711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.807922Z","signature_b64":"Sfhp/CIqqomn6qq4BmtSU5Kg0ahdSO/Hg+kfA8GY36Au3W2DG2Q2GmX51fOCegcX6fxvh+JPeAVf8BcrwHERCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0797e1e22ef6b8b7386978bf9205697d27cdf104309d7dfee942f1454951c9","last_reissued_at":"2026-05-18T00:59:04.807202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.807202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Amina Piemontese, Giulio Colavolpe","submitted_at":"2012-09-25T20:53:01Z","abstract_excerpt":"We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient method to derive an upper bound to the maximum a posteriori probability (MAP) threshold for nonbinary LDPC codes, and observe that the MAP performance of regular LDPC codes improves with the alphabet size. We then consider nonbinary SC-LDPC codes. We show that the same threshold saturation effect experienced by binary SC-LDPC codes occurs for the nonbinary codes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5762","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":"1209.5762","created_at":"2026-05-18T00:59:04.807335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5762v2","created_at":"2026-05-18T00:59:04.807335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5762","created_at":"2026-05-18T00:59:04.807335+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4DZPYPCF33L","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4DZPYPCF33LRNZY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4DZPYPC","created_at":"2026-05-18T12:27:25.539911+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/V4DZPYPCF33LRNZYNF4L7EQFNF","json":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF.json","graph_json":"https://pith.science/api/pith-number/V4DZPYPCF33LRNZYNF4L7EQFNF/graph.json","events_json":"https://pith.science/api/pith-number/V4DZPYPCF33LRNZYNF4L7EQFNF/events.json","paper":"https://pith.science/paper/V4DZPYPC"},"agent_actions":{"view_html":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF","download_json":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF.json","view_paper":"https://pith.science/paper/V4DZPYPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5762&json=true","fetch_graph":"https://pith.science/api/pith-number/V4DZPYPCF33LRNZYNF4L7EQFNF/graph.json","fetch_events":"https://pith.science/api/pith-number/V4DZPYPCF33LRNZYNF4L7EQFNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF/action/storage_attestation","attest_author":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF/action/author_attestation","sign_citation":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF/action/citation_signature","submit_replication":"https://pith.science/pith/V4DZPYPCF33LRNZYNF4L7EQFNF/action/replication_record"}},"created_at":"2026-05-18T00:59:04.807335+00:00","updated_at":"2026-05-18T00:59:04.807335+00:00"}