{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:75SEGSPGULXPREFQ5BWGGGDVVY","short_pith_number":"pith:75SEGSPG","schema_version":"1.0","canonical_sha256":"ff644349e6a2eef890b0e86c631875ae1e4e40abcce3e48dccd20bca20ac409e","source":{"kind":"arxiv","id":"1711.04611","version":2},"attestation_state":"computed","paper":{"title":"A Joint Encryption-Encoding Scheme Using QC-LDPC Codes Based on Finite Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Khayami, Mohammad Reza Aref, Taraneh Eghlidos","submitted_at":"2017-11-13T15:02:22Z","abstract_excerpt":"Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear codes, would shorten the key size as well as improving error correction capability. In this article, we present a joint encryption-encoding scheme using Quasi Cyclic-Low Density Parity Check (QC-LDPC) codes based on finite geometry. We observed that our proposed scheme not only outperforms its predecessors in key size and transmission rate, but also remains "},"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":"1711.04611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-13T15:02:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df87dae47c13b0a082a0a064cd55edca2799c73608e550b4f43838b4598bb6d0","abstract_canon_sha256":"d3671f46034b9df638e02b6030e367f512dd23c29fd391c61597c84e1de557b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:02.963375Z","signature_b64":"znZRV/7bGLqU4a1unnEsuwp+zkjdC/oNLZSLt4SYOKjtPqkStdY+lKhbrTZtoXHAOPPDHG0O9mDWnot+/isWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff644349e6a2eef890b0e86c631875ae1e4e40abcce3e48dccd20bca20ac409e","last_reissued_at":"2026-05-17T23:53:02.962928Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:02.962928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Joint Encryption-Encoding Scheme Using QC-LDPC Codes Based on Finite Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Khayami, Mohammad Reza Aref, Taraneh Eghlidos","submitted_at":"2017-11-13T15:02:22Z","abstract_excerpt":"Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear codes, would shorten the key size as well as improving error correction capability. In this article, we present a joint encryption-encoding scheme using Quasi Cyclic-Low Density Parity Check (QC-LDPC) codes based on finite geometry. We observed that our proposed scheme not only outperforms its predecessors in key size and transmission rate, but also remains "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04611","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":"1711.04611","created_at":"2026-05-17T23:53:02.962982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04611v2","created_at":"2026-05-17T23:53:02.962982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04611","created_at":"2026-05-17T23:53:02.962982+00:00"},{"alias_kind":"pith_short_12","alias_value":"75SEGSPGULXP","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"75SEGSPGULXPREFQ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"75SEGSPG","created_at":"2026-05-18T12:31:03.183658+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/75SEGSPGULXPREFQ5BWGGGDVVY","json":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY.json","graph_json":"https://pith.science/api/pith-number/75SEGSPGULXPREFQ5BWGGGDVVY/graph.json","events_json":"https://pith.science/api/pith-number/75SEGSPGULXPREFQ5BWGGGDVVY/events.json","paper":"https://pith.science/paper/75SEGSPG"},"agent_actions":{"view_html":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY","download_json":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY.json","view_paper":"https://pith.science/paper/75SEGSPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04611&json=true","fetch_graph":"https://pith.science/api/pith-number/75SEGSPGULXPREFQ5BWGGGDVVY/graph.json","fetch_events":"https://pith.science/api/pith-number/75SEGSPGULXPREFQ5BWGGGDVVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY/action/storage_attestation","attest_author":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY/action/author_attestation","sign_citation":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY/action/citation_signature","submit_replication":"https://pith.science/pith/75SEGSPGULXPREFQ5BWGGGDVVY/action/replication_record"}},"created_at":"2026-05-17T23:53:02.962982+00:00","updated_at":"2026-05-17T23:53:02.962982+00:00"}