{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VKWO2QSARTY2FJDJNQ3BORBCE3","short_pith_number":"pith:VKWO2QSA","schema_version":"1.0","canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","source":{"kind":"arxiv","id":"1508.00680","version":1},"attestation_state":"computed","paper":{"title":"Iterative detection and decoding for SCMA systems with LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baicen Xiao, Bin Xia, Hui Liu, Kexin Xiao, Shutian Zhang, Zhiyong Chen","submitted_at":"2015-08-04T07:03:05Z","abstract_excerpt":"Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the propo"},"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":"1508.00680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4525ee48aaf93a61885e47bc5be76f688a9fcac54a02c29771b55b3896cf0daf","abstract_canon_sha256":"7fb1175c9ccdea2f24a21c02f3d6181bc15936392d3f99b5d9aed51ace494ef4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.697149Z","signature_b64":"Zr5popdh4oL9Ycmoz1liSbF+lv190kqLlwtAEDlsyvN+3myX2uAKFrvg4hXSx5urJdkeB4EHFmuL8si40EwaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","last_reissued_at":"2026-05-18T01:35:53.696641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.696641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative detection and decoding for SCMA systems with LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baicen Xiao, Bin Xia, Hui Liu, Kexin Xiao, Shutian Zhang, Zhiyong Chen","submitted_at":"2015-08-04T07:03:05Z","abstract_excerpt":"Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00680","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":"1508.00680","created_at":"2026-05-18T01:35:53.696707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00680v1","created_at":"2026-05-18T01:35:53.696707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00680","created_at":"2026-05-18T01:35:53.696707+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKWO2QSARTY2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKWO2QSARTY2FJDJ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKWO2QSA","created_at":"2026-05-18T12:29:44.643036+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/VKWO2QSARTY2FJDJNQ3BORBCE3","json":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3.json","graph_json":"https://pith.science/api/pith-number/VKWO2QSARTY2FJDJNQ3BORBCE3/graph.json","events_json":"https://pith.science/api/pith-number/VKWO2QSARTY2FJDJNQ3BORBCE3/events.json","paper":"https://pith.science/paper/VKWO2QSA"},"agent_actions":{"view_html":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3","download_json":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3.json","view_paper":"https://pith.science/paper/VKWO2QSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00680&json=true","fetch_graph":"https://pith.science/api/pith-number/VKWO2QSARTY2FJDJNQ3BORBCE3/graph.json","fetch_events":"https://pith.science/api/pith-number/VKWO2QSARTY2FJDJNQ3BORBCE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/action/storage_attestation","attest_author":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/action/author_attestation","sign_citation":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/action/citation_signature","submit_replication":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/action/replication_record"}},"created_at":"2026-05-18T01:35:53.696707+00:00","updated_at":"2026-05-18T01:35:53.696707+00:00"}