{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XSXJIOKVTFWEMG37PU5G2IWCYE","short_pith_number":"pith:XSXJIOKV","schema_version":"1.0","canonical_sha256":"bcae943955996c461b7f7d3a6d22c2c134e817704ce457280dc07975a03fb187","source":{"kind":"arxiv","id":"1701.00210","version":1},"attestation_state":"computed","paper":{"title":"Construction and Encoding of QC-LDPC Codes Using Group Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Kiani, Hassan Khodaiemehr","submitted_at":"2017-01-01T06:01:29Z","abstract_excerpt":"Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings. A group ring is a free module (at the same time a ring) constructed in a natural way from any given ring and any given group. We present a structure based on the elements of a group ring for constructing QC-LDPC codes. Some of the previously addressed methods for constructing QC-LDPC codes based on finite fields are special cases of the proposed"},"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":"1701.00210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-01T06:01:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"902b5354c66506433e1786534dea15e6aecad0faaaccd8184e7feb63b8980edc","abstract_canon_sha256":"041ecc4024f637840932a7f7c35924b3b82505392af4efb2abe2629d6fcc7b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:36.075627Z","signature_b64":"fCbMuFthF9Fmyq4ysEnDpyZkHs/GEs5CBJIjFD8oM20Rzeq8iIHSCWvrS9nuZTuTThV08vPQkPuhEYHraZMuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcae943955996c461b7f7d3a6d22c2c134e817704ce457280dc07975a03fb187","last_reissued_at":"2026-05-18T00:53:36.075188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:36.075188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction and Encoding of QC-LDPC Codes Using Group Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Kiani, Hassan Khodaiemehr","submitted_at":"2017-01-01T06:01:29Z","abstract_excerpt":"Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings. A group ring is a free module (at the same time a ring) constructed in a natural way from any given ring and any given group. We present a structure based on the elements of a group ring for constructing QC-LDPC codes. Some of the previously addressed methods for constructing QC-LDPC codes based on finite fields are special cases of the proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00210","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":"1701.00210","created_at":"2026-05-18T00:53:36.075247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00210v1","created_at":"2026-05-18T00:53:36.075247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00210","created_at":"2026-05-18T00:53:36.075247+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSXJIOKVTFWE","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSXJIOKVTFWEMG37","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSXJIOKV","created_at":"2026-05-18T12:31:56.362134+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/XSXJIOKVTFWEMG37PU5G2IWCYE","json":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE.json","graph_json":"https://pith.science/api/pith-number/XSXJIOKVTFWEMG37PU5G2IWCYE/graph.json","events_json":"https://pith.science/api/pith-number/XSXJIOKVTFWEMG37PU5G2IWCYE/events.json","paper":"https://pith.science/paper/XSXJIOKV"},"agent_actions":{"view_html":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE","download_json":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE.json","view_paper":"https://pith.science/paper/XSXJIOKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00210&json=true","fetch_graph":"https://pith.science/api/pith-number/XSXJIOKVTFWEMG37PU5G2IWCYE/graph.json","fetch_events":"https://pith.science/api/pith-number/XSXJIOKVTFWEMG37PU5G2IWCYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE/action/storage_attestation","attest_author":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE/action/author_attestation","sign_citation":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE/action/citation_signature","submit_replication":"https://pith.science/pith/XSXJIOKVTFWEMG37PU5G2IWCYE/action/replication_record"}},"created_at":"2026-05-18T00:53:36.075247+00:00","updated_at":"2026-05-18T00:53:36.075247+00:00"}