{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IXM4ISE4MM7HRCBDWGUCXHHWOE","short_pith_number":"pith:IXM4ISE4","schema_version":"1.0","canonical_sha256":"45d9c4489c633e788823b1a82b9cf6710eb19da289682967ff3b6ca193d68e45","source":{"kind":"arxiv","id":"1111.0703","version":1},"attestation_state":"computed","paper":{"title":"Efficient Network for Non-Binary QC-LDPC Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chuan Zhang, Keshab K. Parhi","submitted_at":"2011-11-03T01:10:43Z","abstract_excerpt":"This paper presents approaches to develop efficient network for non-binary quasi-cyclic LDPC (QC-LDPC) decoders. By exploiting the intrinsic shifting and symmetry properties of the check matrices, significant reduction of memory size and routing complexity can be achieved. Two different efficient network architectures for Class-I and Class-II non-binary QC-LDPC decoders have been proposed, respectively. Comparison results have shown that for the code of the 64-ary (1260, 630) rate-0.5 Class-I code, the proposed scheme can save more than 70.6% hardware required by shuffle network than the state"},"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":"1111.0703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2011-11-03T01:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"a228376447efc4c836d858dbb53b75c6b713e8d410c5100101c735439a6038e6","abstract_canon_sha256":"edab76f04a5ff96f9db745124791c897ec36c09e7deaf60867c8bf8a12c387af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:37.110081Z","signature_b64":"l2mRGHjmOMY3Py2Cb7lzMULNJy2cJqclhgH7t2LF3GCRwUiZYu3wB2/t9Yi4FRuch0UjnZbSRbc/EaiXSjq4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d9c4489c633e788823b1a82b9cf6710eb19da289682967ff3b6ca193d68e45","last_reissued_at":"2026-05-18T04:09:37.109423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:37.109423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Network for Non-Binary QC-LDPC Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chuan Zhang, Keshab K. Parhi","submitted_at":"2011-11-03T01:10:43Z","abstract_excerpt":"This paper presents approaches to develop efficient network for non-binary quasi-cyclic LDPC (QC-LDPC) decoders. By exploiting the intrinsic shifting and symmetry properties of the check matrices, significant reduction of memory size and routing complexity can be achieved. Two different efficient network architectures for Class-I and Class-II non-binary QC-LDPC decoders have been proposed, respectively. Comparison results have shown that for the code of the 64-ary (1260, 630) rate-0.5 Class-I code, the proposed scheme can save more than 70.6% hardware required by shuffle network than the state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0703","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":"1111.0703","created_at":"2026-05-18T04:09:37.109528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0703v1","created_at":"2026-05-18T04:09:37.109528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0703","created_at":"2026-05-18T04:09:37.109528+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXM4ISE4MM7H","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXM4ISE4MM7HRCBD","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXM4ISE4","created_at":"2026-05-18T12:26:32.869790+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/IXM4ISE4MM7HRCBDWGUCXHHWOE","json":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE.json","graph_json":"https://pith.science/api/pith-number/IXM4ISE4MM7HRCBDWGUCXHHWOE/graph.json","events_json":"https://pith.science/api/pith-number/IXM4ISE4MM7HRCBDWGUCXHHWOE/events.json","paper":"https://pith.science/paper/IXM4ISE4"},"agent_actions":{"view_html":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE","download_json":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE.json","view_paper":"https://pith.science/paper/IXM4ISE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0703&json=true","fetch_graph":"https://pith.science/api/pith-number/IXM4ISE4MM7HRCBDWGUCXHHWOE/graph.json","fetch_events":"https://pith.science/api/pith-number/IXM4ISE4MM7HRCBDWGUCXHHWOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE/action/storage_attestation","attest_author":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE/action/author_attestation","sign_citation":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE/action/citation_signature","submit_replication":"https://pith.science/pith/IXM4ISE4MM7HRCBDWGUCXHHWOE/action/replication_record"}},"created_at":"2026-05-18T04:09:37.109528+00:00","updated_at":"2026-05-18T04:09:37.109528+00:00"}