{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TBJIS5ZDBBGYD6OMVKGVQ3GFEO","short_pith_number":"pith:TBJIS5ZD","schema_version":"1.0","canonical_sha256":"9852897723084d81f9ccaa8d586cc5239f1b38ded0590b84510b8b6f7f6488c4","source":{"kind":"arxiv","id":"1103.2573","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Er Yang Zhang, Tian Peng Ren, Yong Liang Guan, Yue Zhou","submitted_at":"2011-03-14T02:34:24Z","abstract_excerpt":"Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure with special QR decomposition characteristics. In this paper, we adopt a simplified form of this fast-decodable code structure and present a new way to optimize the code analytically. We show that the signal constellation topology (such as QAM, APSK, or PSK) has a critical impact on the existence of non-vanishing determinants of the full-rate STBC. In partic"},"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":"1103.2573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-14T02:34:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2246763c158ec7d059c526ba3447153105dcb1102ee61a713fd18033cde6554","abstract_canon_sha256":"6cff1b9f229ecb625f9892009d31889a47ab2fe4692e51fdfd9562696871ab79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.019417Z","signature_b64":"PRrc14NEDzVdel7XVhjzXCxvRSFBWLHGJZhxd2lvCie7RuSyMbsE2GwpSSHqehqqaTJddX9JlWfvu7pYk8x5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9852897723084d81f9ccaa8d586cc5239f1b38ded0590b84510b8b6f7f6488c4","last_reissued_at":"2026-05-18T00:58:19.018698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.018698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Er Yang Zhang, Tian Peng Ren, Yong Liang Guan, Yue Zhou","submitted_at":"2011-03-14T02:34:24Z","abstract_excerpt":"Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure with special QR decomposition characteristics. In this paper, we adopt a simplified form of this fast-decodable code structure and present a new way to optimize the code analytically. We show that the signal constellation topology (such as QAM, APSK, or PSK) has a critical impact on the existence of non-vanishing determinants of the full-rate STBC. In partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2573","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":"1103.2573","created_at":"2026-05-18T00:58:19.018814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2573v1","created_at":"2026-05-18T00:58:19.018814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2573","created_at":"2026-05-18T00:58:19.018814+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBJIS5ZDBBGY","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBJIS5ZDBBGYD6OM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBJIS5ZD","created_at":"2026-05-18T12:26:42.757692+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/TBJIS5ZDBBGYD6OMVKGVQ3GFEO","json":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO.json","graph_json":"https://pith.science/api/pith-number/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/graph.json","events_json":"https://pith.science/api/pith-number/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/events.json","paper":"https://pith.science/paper/TBJIS5ZD"},"agent_actions":{"view_html":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO","download_json":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO.json","view_paper":"https://pith.science/paper/TBJIS5ZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2573&json=true","fetch_graph":"https://pith.science/api/pith-number/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/graph.json","fetch_events":"https://pith.science/api/pith-number/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/action/storage_attestation","attest_author":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/action/author_attestation","sign_citation":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/action/citation_signature","submit_replication":"https://pith.science/pith/TBJIS5ZDBBGYD6OMVKGVQ3GFEO/action/replication_record"}},"created_at":"2026-05-18T00:58:19.018814+00:00","updated_at":"2026-05-18T00:58:19.018814+00:00"}