{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IUYNL3TCMNUFT46NYAYJ5S2N6U","short_pith_number":"pith:IUYNL3TC","schema_version":"1.0","canonical_sha256":"4530d5ee62636859f3cdc0309ecb4df532ea68fd717ef97e7cf465bba454ee79","source":{"kind":"arxiv","id":"1009.3514","version":2},"attestation_state":"computed","paper":{"title":"Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boyu Li, Ender Ayanoglu, Hong Ju Park","submitted_at":"2010-09-17T21:29:08Z","abstract_excerpt":"Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS<=1. Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding (BICMB-CP), on the other hand, can achieve full diversity without the condition RcS<=1. However, the decoding complexity of BICMB-CP is much higher than BICMB. In this paper, a reduced complexi"},"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":"1009.3514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-17T21:29:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02ed2585c48b9eea21e3c51d70479c45982d2dc2d02f2f40ea78856991ca3b56","abstract_canon_sha256":"4cfc2407404c4f9198cbae1a51fb1861567d0e7701839a6244038405f8653cc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.231761Z","signature_b64":"drTad0uu0AT4sMVL2qzOdyFaJ5LXDGhCMkmspC7EpisUqv/aEUUTmBmszMtjOMA+B4y1rZJ8s4rk3BYTh/n1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4530d5ee62636859f3cdc0309ecb4df532ea68fd717ef97e7cf465bba454ee79","last_reissued_at":"2026-05-18T03:48:45.231035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.231035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boyu Li, Ender Ayanoglu, Hong Ju Park","submitted_at":"2010-09-17T21:29:08Z","abstract_excerpt":"Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS<=1. Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding (BICMB-CP), on the other hand, can achieve full diversity without the condition RcS<=1. However, the decoding complexity of BICMB-CP is much higher than BICMB. In this paper, a reduced complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3514","kind":"arxiv","version":2},"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":"1009.3514","created_at":"2026-05-18T03:48:45.231138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3514v2","created_at":"2026-05-18T03:48:45.231138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3514","created_at":"2026-05-18T03:48:45.231138+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUYNL3TCMNUF","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUYNL3TCMNUFT46N","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUYNL3TC","created_at":"2026-05-18T12:26:09.077623+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/IUYNL3TCMNUFT46NYAYJ5S2N6U","json":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U.json","graph_json":"https://pith.science/api/pith-number/IUYNL3TCMNUFT46NYAYJ5S2N6U/graph.json","events_json":"https://pith.science/api/pith-number/IUYNL3TCMNUFT46NYAYJ5S2N6U/events.json","paper":"https://pith.science/paper/IUYNL3TC"},"agent_actions":{"view_html":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U","download_json":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U.json","view_paper":"https://pith.science/paper/IUYNL3TC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3514&json=true","fetch_graph":"https://pith.science/api/pith-number/IUYNL3TCMNUFT46NYAYJ5S2N6U/graph.json","fetch_events":"https://pith.science/api/pith-number/IUYNL3TCMNUFT46NYAYJ5S2N6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U/action/storage_attestation","attest_author":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U/action/author_attestation","sign_citation":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U/action/citation_signature","submit_replication":"https://pith.science/pith/IUYNL3TCMNUFT46NYAYJ5S2N6U/action/replication_record"}},"created_at":"2026-05-18T03:48:45.231138+00:00","updated_at":"2026-05-18T03:48:45.231138+00:00"}