{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NDJN2HEATRDOPZV67BI2KGIIVF","short_pith_number":"pith:NDJN2HEA","schema_version":"1.0","canonical_sha256":"68d2dd1c809c46e7e6bef851a51908a94655a9a57d240727d81b9c5d646b7fa5","source":{"kind":"arxiv","id":"0902.3076","version":1},"attestation_state":"computed","paper":{"title":"Coding for the Non-Orthogonal Amplify-and-Forward Cooperative Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghassan M. Kraidy, Joseph J. Boutros, Nicolas Gresset","submitted_at":"2009-02-18T10:23:28Z","abstract_excerpt":"In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity order of the NAF protocol that are achieved by a distributed space-time bit-interleaved coded modulation (D-ST-BICM) scheme under iterative APP detection and decoding. These bounds lead to the design of space-time precoders that ensure maximum diversity order and high coding gains. The word error rate performance of D-ST-BICM are also compared to outage pro"},"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":"0902.3076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-18T10:23:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a4543e8c5cbcb7e22c2e98ded109839306aa062522f668d22714a748b8e5cfd","abstract_canon_sha256":"1c84ebb38f98cb0dfe3ed2f50a4c865fdcca608da785221e177ffa83b7aa1219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.432818Z","signature_b64":"MiYJXxN1g9ufGuopwSybo7hIqrOvNOU8UMMExhI+o/zi09E612vGj0Bojs4Pd5vmVifFx+3efVB3XXkcnd2mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68d2dd1c809c46e7e6bef851a51908a94655a9a57d240727d81b9c5d646b7fa5","last_reissued_at":"2026-05-18T00:59:11.432145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.432145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding for the Non-Orthogonal Amplify-and-Forward Cooperative Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghassan M. Kraidy, Joseph J. Boutros, Nicolas Gresset","submitted_at":"2009-02-18T10:23:28Z","abstract_excerpt":"In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity order of the NAF protocol that are achieved by a distributed space-time bit-interleaved coded modulation (D-ST-BICM) scheme under iterative APP detection and decoding. These bounds lead to the design of space-time precoders that ensure maximum diversity order and high coding gains. The word error rate performance of D-ST-BICM are also compared to outage pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3076","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":"0902.3076","created_at":"2026-05-18T00:59:11.432282+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.3076v1","created_at":"2026-05-18T00:59:11.432282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3076","created_at":"2026-05-18T00:59:11.432282+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDJN2HEATRDO","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDJN2HEATRDOPZV6","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDJN2HEA","created_at":"2026-05-18T12:26:00.592388+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/NDJN2HEATRDOPZV67BI2KGIIVF","json":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF.json","graph_json":"https://pith.science/api/pith-number/NDJN2HEATRDOPZV67BI2KGIIVF/graph.json","events_json":"https://pith.science/api/pith-number/NDJN2HEATRDOPZV67BI2KGIIVF/events.json","paper":"https://pith.science/paper/NDJN2HEA"},"agent_actions":{"view_html":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF","download_json":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF.json","view_paper":"https://pith.science/paper/NDJN2HEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.3076&json=true","fetch_graph":"https://pith.science/api/pith-number/NDJN2HEATRDOPZV67BI2KGIIVF/graph.json","fetch_events":"https://pith.science/api/pith-number/NDJN2HEATRDOPZV67BI2KGIIVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF/action/storage_attestation","attest_author":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF/action/author_attestation","sign_citation":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF/action/citation_signature","submit_replication":"https://pith.science/pith/NDJN2HEATRDOPZV67BI2KGIIVF/action/replication_record"}},"created_at":"2026-05-18T00:59:11.432282+00:00","updated_at":"2026-05-18T00:59:11.432282+00:00"}