{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ACPYLV6IHLC6LSYJVDOOTC35E7","short_pith_number":"pith:ACPYLV6I","schema_version":"1.0","canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","source":{"kind":"arxiv","id":"1204.4000","version":1},"attestation_state":"computed","paper":{"title":"A New Family of Low-Complexity Decodable STBCs for Four Transmit Antennas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr Ismail, Hikmet Sari, Jocelyn Fiorina","submitted_at":"2012-04-18T07:52:48Z","abstract_excerpt":"In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is then optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. In a second step, we propose a new rate-2 STBC that multiplexes two of our rate-1 codes by the means of a unitary ma"},"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":"1204.4000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eeed09998232302a99f50074db4f975cd1d4e196da9610116144d35ed2f4cfee","abstract_canon_sha256":"02b73d8f62b54679fb1d44a6ac36c935ab937281f2bc5ebae381589b6b837939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.294277Z","signature_b64":"sRySb2LEVffL4BzFwgjChqQjvVwSe9ZIvU09VUkacazqMC45BHV2UJMzw1xR0t1JWCvSKTniKbvgDvrOaawoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","last_reissued_at":"2026-05-18T00:58:18.293596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.293596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Family of Low-Complexity Decodable STBCs for Four Transmit Antennas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr Ismail, Hikmet Sari, Jocelyn Fiorina","submitted_at":"2012-04-18T07:52:48Z","abstract_excerpt":"In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is then optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. In a second step, we propose a new rate-2 STBC that multiplexes two of our rate-1 codes by the means of a unitary ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4000","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":"1204.4000","created_at":"2026-05-18T00:58:18.293695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4000v1","created_at":"2026-05-18T00:58:18.293695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4000","created_at":"2026-05-18T00:58:18.293695+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACPYLV6IHLC6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACPYLV6IHLC6LSYJ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACPYLV6I","created_at":"2026-05-18T12:26:58.693483+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/ACPYLV6IHLC6LSYJVDOOTC35E7","json":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7.json","graph_json":"https://pith.science/api/pith-number/ACPYLV6IHLC6LSYJVDOOTC35E7/graph.json","events_json":"https://pith.science/api/pith-number/ACPYLV6IHLC6LSYJVDOOTC35E7/events.json","paper":"https://pith.science/paper/ACPYLV6I"},"agent_actions":{"view_html":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7","download_json":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7.json","view_paper":"https://pith.science/paper/ACPYLV6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4000&json=true","fetch_graph":"https://pith.science/api/pith-number/ACPYLV6IHLC6LSYJVDOOTC35E7/graph.json","fetch_events":"https://pith.science/api/pith-number/ACPYLV6IHLC6LSYJVDOOTC35E7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/action/storage_attestation","attest_author":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/action/author_attestation","sign_citation":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/action/citation_signature","submit_replication":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/action/replication_record"}},"created_at":"2026-05-18T00:58:18.293695+00:00","updated_at":"2026-05-18T00:58:18.293695+00:00"}