{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I4DCKVXIXD2ZRGYHYWOFHPJZV4","short_pith_number":"pith:I4DCKVXI","schema_version":"1.0","canonical_sha256":"47062556e8b8f5989b07c59c53bd39af259517bb387f4eb87322e123b1dcbd0d","source":{"kind":"arxiv","id":"1304.6614","version":1},"attestation_state":"computed","paper":{"title":"Performance Analysis of Protograph LDPC Codes for Nakagami-$m$ Fading Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kai-Kit Wong, Kin-Fai Tong, Lin Wang, Yi Fang","submitted_at":"2013-04-24T14:58:29Z","abstract_excerpt":"In this paper, we investigate the error performance of the protograph (LDPC) codes over Nakagami-$m$ fading relay channels. We first calculate the decoding thresholds of the protograph codes over such channels with different fading depths (i.e., different values of $m$) by exploiting the modified protograph extrinsic information transfer (PEXIT) algorithm. Furthermore, based on the PEXIT analysis and using Gaussian approximation, we derive the bit-error-rate (BER) expressions for the error-free (EF) relaying protocol and decode-and-forward (DF) relaying protocol. We finally compare the thresho"},"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":"1304.6614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T14:58:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4a17b5f332dcd38b03ec6526e5a6d103b59d2882d49b5cbbdc68c9f0f2664aa1","abstract_canon_sha256":"87853e8d674725ef45fd2957ab8f86286ddd07a8230f164907ff881b767b706d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.595286Z","signature_b64":"2+Ca2h9xApOg2eGe1HZ1ZIWGc3QLn89Bp35jAcgUhyxHtn+eryTuRBMf8OlNKNzWHaszjuJimagTGrdiCmzsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47062556e8b8f5989b07c59c53bd39af259517bb387f4eb87322e123b1dcbd0d","last_reissued_at":"2026-05-18T03:27:12.594546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.594546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of Protograph LDPC Codes for Nakagami-$m$ Fading Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kai-Kit Wong, Kin-Fai Tong, Lin Wang, Yi Fang","submitted_at":"2013-04-24T14:58:29Z","abstract_excerpt":"In this paper, we investigate the error performance of the protograph (LDPC) codes over Nakagami-$m$ fading relay channels. We first calculate the decoding thresholds of the protograph codes over such channels with different fading depths (i.e., different values of $m$) by exploiting the modified protograph extrinsic information transfer (PEXIT) algorithm. Furthermore, based on the PEXIT analysis and using Gaussian approximation, we derive the bit-error-rate (BER) expressions for the error-free (EF) relaying protocol and decode-and-forward (DF) relaying protocol. We finally compare the thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6614","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":"1304.6614","created_at":"2026-05-18T03:27:12.594668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6614v1","created_at":"2026-05-18T03:27:12.594668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6614","created_at":"2026-05-18T03:27:12.594668+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4DCKVXIXD2Z","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4DCKVXIXD2ZRGYH","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4DCKVXI","created_at":"2026-05-18T12:27:46.883200+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/I4DCKVXIXD2ZRGYHYWOFHPJZV4","json":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4.json","graph_json":"https://pith.science/api/pith-number/I4DCKVXIXD2ZRGYHYWOFHPJZV4/graph.json","events_json":"https://pith.science/api/pith-number/I4DCKVXIXD2ZRGYHYWOFHPJZV4/events.json","paper":"https://pith.science/paper/I4DCKVXI"},"agent_actions":{"view_html":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4","download_json":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4.json","view_paper":"https://pith.science/paper/I4DCKVXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6614&json=true","fetch_graph":"https://pith.science/api/pith-number/I4DCKVXIXD2ZRGYHYWOFHPJZV4/graph.json","fetch_events":"https://pith.science/api/pith-number/I4DCKVXIXD2ZRGYHYWOFHPJZV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4/action/storage_attestation","attest_author":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4/action/author_attestation","sign_citation":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4/action/citation_signature","submit_replication":"https://pith.science/pith/I4DCKVXIXD2ZRGYHYWOFHPJZV4/action/replication_record"}},"created_at":"2026-05-18T03:27:12.594668+00:00","updated_at":"2026-05-18T03:27:12.594668+00:00"}