{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CBHTGRKLHHKNB6OERGOA3YGQ3Q","short_pith_number":"pith:CBHTGRKL","schema_version":"1.0","canonical_sha256":"104f33454b39d4d0f9c4899c0de0d0dc1d7ade11e6b57997509427eecf1c353e","source":{"kind":"arxiv","id":"2110.15010","version":1},"attestation_state":"computed","paper":{"title":"NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alva Kosasih, Branka Vucetic, Chentao Yue, Giyoon Park, Mahyar Shirvanimoghaddam, Ok-Sun Park, Wibowo Hardjawana, Yonghui Li","submitted_at":"2021-10-28T10:46:38Z","abstract_excerpt":"In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding stopping condition, derived from approximations of the a-posterior probabilities of codeword estimates. Simulation results show that LC-SOSD has the similar mutual information transform property to the original SOSD with a significantly reduced complexity. Then, based on the analysis, an efficient JD receiver which combines the parallel interference cancellat"},"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":"2110.15010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-10-28T10:46:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2186ea607132ff618f59e5503b36f89fd0bf9806d3e5db4f6e50dc100f42341a","abstract_canon_sha256":"92e84651065fd456e13df3e60deae2fe9472d152018488f0d5f8e08772412a6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:50.512891Z","signature_b64":"xc3LbgJxTeRiHRx5MqLaQoE+OKFzKI4H4jIZhGFrbTl+On0kypT0krVZmTEr/wkAM834x5cBcyK18AaH4ohSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"104f33454b39d4d0f9c4899c0de0d0dc1d7ade11e6b57997509427eecf1c353e","last_reissued_at":"2026-07-05T03:26:50.511420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:50.511420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alva Kosasih, Branka Vucetic, Chentao Yue, Giyoon Park, Mahyar Shirvanimoghaddam, Ok-Sun Park, Wibowo Hardjawana, Yonghui Li","submitted_at":"2021-10-28T10:46:38Z","abstract_excerpt":"In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding stopping condition, derived from approximations of the a-posterior probabilities of codeword estimates. Simulation results show that LC-SOSD has the similar mutual information transform property to the original SOSD with a significantly reduced complexity. Then, based on the analysis, an efficient JD receiver which combines the parallel interference cancellat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15010","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.15010/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.15010","created_at":"2026-07-05T03:26:50.512465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.15010v1","created_at":"2026-07-05T03:26:50.512465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.15010","created_at":"2026-07-05T03:26:50.512465+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBHTGRKLHHKN","created_at":"2026-07-05T03:26:50.512465+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBHTGRKLHHKNB6OE","created_at":"2026-07-05T03:26:50.512465+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBHTGRKL","created_at":"2026-07-05T03:26:50.512465+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/CBHTGRKLHHKNB6OERGOA3YGQ3Q","json":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q.json","graph_json":"https://pith.science/api/pith-number/CBHTGRKLHHKNB6OERGOA3YGQ3Q/graph.json","events_json":"https://pith.science/api/pith-number/CBHTGRKLHHKNB6OERGOA3YGQ3Q/events.json","paper":"https://pith.science/paper/CBHTGRKL"},"agent_actions":{"view_html":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q","download_json":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q.json","view_paper":"https://pith.science/paper/CBHTGRKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.15010&json=true","fetch_graph":"https://pith.science/api/pith-number/CBHTGRKLHHKNB6OERGOA3YGQ3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/CBHTGRKLHHKNB6OERGOA3YGQ3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q/action/storage_attestation","attest_author":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q/action/author_attestation","sign_citation":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q/action/citation_signature","submit_replication":"https://pith.science/pith/CBHTGRKLHHKNB6OERGOA3YGQ3Q/action/replication_record"}},"created_at":"2026-07-05T03:26:50.512465+00:00","updated_at":"2026-07-05T03:26:50.512465+00:00"}