{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JB6LO4JTD6OKPZ4ITMYCGWA2QB","short_pith_number":"pith:JB6LO4JT","schema_version":"1.0","canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","source":{"kind":"arxiv","id":"1902.09525","version":1},"attestation_state":"computed","paper":{"title":"Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude D'Amours, Gurgen Khachatrian, Halim Yanikomeroglu, Hovannes Kulhandjian, Michel Kulhandjian","submitted_at":"2019-02-24T01:24:46Z","abstract_excerpt":"In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that th"},"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":"1902.09525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-24T01:24:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c84a0d91aa5db1ce2a4ddc5278dbd201f85a563b8eb51e0bc650ad7574fb1680","abstract_canon_sha256":"ba26958413b5d1050c5be62640befb6548420ea5e277d10cef3570bd54014c28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:45.293925Z","signature_b64":"mAq8gO3/LQjD1mvV9Ae7o8HLaXH1Y3ppU1kD5ZokCTb4Fuhd7e4mUHDZr1DtDpHxLJe1hx4OROgGeDMnrElCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487cb771331f9ca7e7889b3023581a805fa3af98314e640d2cd2172f141ce276","last_reissued_at":"2026-05-17T23:52:45.293163Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:45.293163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude D'Amours, Gurgen Khachatrian, Halim Yanikomeroglu, Hovannes Kulhandjian, Michel Kulhandjian","submitted_at":"2019-02-24T01:24:46Z","abstract_excerpt":"In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09525","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":"1902.09525","created_at":"2026-05-17T23:52:45.293269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09525v1","created_at":"2026-05-17T23:52:45.293269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09525","created_at":"2026-05-17T23:52:45.293269+00:00"},{"alias_kind":"pith_short_12","alias_value":"JB6LO4JTD6OK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JB6LO4JTD6OKPZ4I","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JB6LO4JT","created_at":"2026-05-18T12:33:18.533446+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/JB6LO4JTD6OKPZ4ITMYCGWA2QB","json":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB.json","graph_json":"https://pith.science/api/pith-number/JB6LO4JTD6OKPZ4ITMYCGWA2QB/graph.json","events_json":"https://pith.science/api/pith-number/JB6LO4JTD6OKPZ4ITMYCGWA2QB/events.json","paper":"https://pith.science/paper/JB6LO4JT"},"agent_actions":{"view_html":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB","download_json":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB.json","view_paper":"https://pith.science/paper/JB6LO4JT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09525&json=true","fetch_graph":"https://pith.science/api/pith-number/JB6LO4JTD6OKPZ4ITMYCGWA2QB/graph.json","fetch_events":"https://pith.science/api/pith-number/JB6LO4JTD6OKPZ4ITMYCGWA2QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/action/storage_attestation","attest_author":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/action/author_attestation","sign_citation":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/action/citation_signature","submit_replication":"https://pith.science/pith/JB6LO4JTD6OKPZ4ITMYCGWA2QB/action/replication_record"}},"created_at":"2026-05-17T23:52:45.293269+00:00","updated_at":"2026-05-17T23:52:45.293269+00:00"}