{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ROGUTXRQEEHXIYT5JFKSZUOEOQ","short_pith_number":"pith:ROGUTXRQ","schema_version":"1.0","canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","source":{"kind":"arxiv","id":"0906.2819","version":1},"attestation_state":"computed","paper":{"title":"Disjoint LDPC Coding for Gaussian Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Ramezani, Masoud Ardakani","submitted_at":"2009-06-15T23:09:04Z","abstract_excerpt":"Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at each user. Also, a joint code design procedure should be performed. We propose a method which uses a novel labeling strategy and is based on the idea behind the bit-interleaved coded modulation. This method does not require joint decoding and/or joint code optimization. Thus, it reduces the overall complexity of near-capacity coding in broadcast channels. F"},"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":"0906.2819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"228a23caa87de8b8cf0b467faa88998ea99c7ed82014b904019fd77cd98e240d","abstract_canon_sha256":"abf9e2d6790a70886850a4fcc3bb46a9073f9d3dfbc2ec540961d51332363bac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.149212Z","signature_b64":"MHcGkRN7/2uFtAZFJciN6cD/ZK/e4dkK/eZBNC5cfrtM9FIklP48IodMmiakMxkAOTuMRj27zDmLVBwnKIGbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","last_reissued_at":"2026-05-18T00:57:58.148630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.148630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint LDPC Coding for Gaussian Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Ramezani, Masoud Ardakani","submitted_at":"2009-06-15T23:09:04Z","abstract_excerpt":"Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at each user. Also, a joint code design procedure should be performed. We propose a method which uses a novel labeling strategy and is based on the idea behind the bit-interleaved coded modulation. This method does not require joint decoding and/or joint code optimization. Thus, it reduces the overall complexity of near-capacity coding in broadcast channels. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2819","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":"0906.2819","created_at":"2026-05-18T00:57:58.148713+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.2819v1","created_at":"2026-05-18T00:57:58.148713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2819","created_at":"2026-05-18T00:57:58.148713+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROGUTXRQEEHX","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROGUTXRQEEHXIYT5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROGUTXRQ","created_at":"2026-05-18T12:26:01.383474+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/ROGUTXRQEEHXIYT5JFKSZUOEOQ","json":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ.json","graph_json":"https://pith.science/api/pith-number/ROGUTXRQEEHXIYT5JFKSZUOEOQ/graph.json","events_json":"https://pith.science/api/pith-number/ROGUTXRQEEHXIYT5JFKSZUOEOQ/events.json","paper":"https://pith.science/paper/ROGUTXRQ"},"agent_actions":{"view_html":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ","download_json":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ.json","view_paper":"https://pith.science/paper/ROGUTXRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.2819&json=true","fetch_graph":"https://pith.science/api/pith-number/ROGUTXRQEEHXIYT5JFKSZUOEOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ROGUTXRQEEHXIYT5JFKSZUOEOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/action/storage_attestation","attest_author":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/action/author_attestation","sign_citation":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/action/citation_signature","submit_replication":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/action/replication_record"}},"created_at":"2026-05-18T00:57:58.148713+00:00","updated_at":"2026-05-18T00:57:58.148713+00:00"}