{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D34WLGPRXSBOOFU7KCXMMKX6LL","short_pith_number":"pith:D34WLGPR","schema_version":"1.0","canonical_sha256":"1ef96599f1bc82e7169f50aec62afe5ae323a67b7c5843eeb7abf638c8fb3785","source":{"kind":"arxiv","id":"1504.06416","version":1},"attestation_state":"computed","paper":{"title":"On the Minimum Distance of Array-Based Spatially-Coupled Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes","submitted_at":"2015-04-24T08:04:47Z","abstract_excerpt":"An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers $q$ and $m$, where $q$ is an odd prime and $m \\leq q$. The exact minimum distance, for small $q$ and $m$, has been calculated, and tight upper bounds on it for $m \\leq 7$ have been derived. In this work, we study the minimum distance of the spatially-coupled version of these codes. In particular, several tight upper bounds on the optimal minimum distance for coupling length at least two and $m=3,4,5$, that are independent of $q$ and that are valid for all values of $q \\geq q_0$ where $q_0$ depen"},"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":"1504.06416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-24T08:04:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd6db682000eec25d495ba4992bdefdfb34e33fc46bd9433c348c5ce333d5be1","abstract_canon_sha256":"520a16a282eb1a83b6942347ac139ff02e08565c1b9f2dd7d923f406b930f51e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.740130Z","signature_b64":"HG5o1xr1jJtZT+kRqI0JY9+la3m9mcVnvc6xIf8sNz9gALpMKXQxVkwmtcJPyt9kmsw94tdg9M2yxZ4Bf/7+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef96599f1bc82e7169f50aec62afe5ae323a67b7c5843eeb7abf638c8fb3785","last_reissued_at":"2026-05-18T00:58:35.739465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.739465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimum Distance of Array-Based Spatially-Coupled Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes","submitted_at":"2015-04-24T08:04:47Z","abstract_excerpt":"An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers $q$ and $m$, where $q$ is an odd prime and $m \\leq q$. The exact minimum distance, for small $q$ and $m$, has been calculated, and tight upper bounds on it for $m \\leq 7$ have been derived. In this work, we study the minimum distance of the spatially-coupled version of these codes. In particular, several tight upper bounds on the optimal minimum distance for coupling length at least two and $m=3,4,5$, that are independent of $q$ and that are valid for all values of $q \\geq q_0$ where $q_0$ depen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06416","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":"1504.06416","created_at":"2026-05-18T00:58:35.739571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06416v1","created_at":"2026-05-18T00:58:35.739571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06416","created_at":"2026-05-18T00:58:35.739571+00:00"},{"alias_kind":"pith_short_12","alias_value":"D34WLGPRXSBO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D34WLGPRXSBOOFU7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D34WLGPR","created_at":"2026-05-18T12:29:17.054201+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/D34WLGPRXSBOOFU7KCXMMKX6LL","json":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL.json","graph_json":"https://pith.science/api/pith-number/D34WLGPRXSBOOFU7KCXMMKX6LL/graph.json","events_json":"https://pith.science/api/pith-number/D34WLGPRXSBOOFU7KCXMMKX6LL/events.json","paper":"https://pith.science/paper/D34WLGPR"},"agent_actions":{"view_html":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL","download_json":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL.json","view_paper":"https://pith.science/paper/D34WLGPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06416&json=true","fetch_graph":"https://pith.science/api/pith-number/D34WLGPRXSBOOFU7KCXMMKX6LL/graph.json","fetch_events":"https://pith.science/api/pith-number/D34WLGPRXSBOOFU7KCXMMKX6LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL/action/storage_attestation","attest_author":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL/action/author_attestation","sign_citation":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL/action/citation_signature","submit_replication":"https://pith.science/pith/D34WLGPRXSBOOFU7KCXMMKX6LL/action/replication_record"}},"created_at":"2026-05-18T00:58:35.739571+00:00","updated_at":"2026-05-18T00:58:35.739571+00:00"}