{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AVCYEICJTKZMGFQMTL6W2IW6BB","short_pith_number":"pith:AVCYEICJ","schema_version":"1.0","canonical_sha256":"05458220499ab2c3160c9afd6d22de0878c1ef534edf75ed327fcc67080c46e2","source":{"kind":"arxiv","id":"1401.1206","version":1},"attestation_state":"computed","paper":{"title":"A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jean-Fran\\c{c}ois H\\'elard (IETR), Maryline H\\'elard (IETR), Matthieu Crussi\\`ere (IETR), Ming Liu (IETR)","submitted_at":"2014-01-06T20:04:19Z","abstract_excerpt":"In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M^{4.5}) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that th"},"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":"1401.1206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-06T20:04:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dab07c3fc3a176a4ce41b49d1cb788b779e01b00b37cd6bcb3db7d667d883043","abstract_canon_sha256":"9ab39bf9e82711da7539164d1633235021c791c68ad1d3e8d2a5aeb34d6b9301"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:09.351909Z","signature_b64":"OzVbWzZx1qtuBiaA2mK7AJZt5qVAyRd1G2yFnw1L+W160I9af8zB+k9l5gPq8WYJ5vFkCNpFTalIWSuqWsarBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05458220499ab2c3160c9afd6d22de0878c1ef534edf75ed327fcc67080c46e2","last_reissued_at":"2026-05-18T03:03:09.351285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:09.351285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jean-Fran\\c{c}ois H\\'elard (IETR), Maryline H\\'elard (IETR), Matthieu Crussi\\`ere (IETR), Ming Liu (IETR)","submitted_at":"2014-01-06T20:04:19Z","abstract_excerpt":"In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M^{4.5}) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1206","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":"1401.1206","created_at":"2026-05-18T03:03:09.351395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1206v1","created_at":"2026-05-18T03:03:09.351395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1206","created_at":"2026-05-18T03:03:09.351395+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVCYEICJTKZM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVCYEICJTKZMGFQM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVCYEICJ","created_at":"2026-05-18T12:28:19.803747+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/AVCYEICJTKZMGFQMTL6W2IW6BB","json":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB.json","graph_json":"https://pith.science/api/pith-number/AVCYEICJTKZMGFQMTL6W2IW6BB/graph.json","events_json":"https://pith.science/api/pith-number/AVCYEICJTKZMGFQMTL6W2IW6BB/events.json","paper":"https://pith.science/paper/AVCYEICJ"},"agent_actions":{"view_html":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB","download_json":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB.json","view_paper":"https://pith.science/paper/AVCYEICJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1206&json=true","fetch_graph":"https://pith.science/api/pith-number/AVCYEICJTKZMGFQMTL6W2IW6BB/graph.json","fetch_events":"https://pith.science/api/pith-number/AVCYEICJTKZMGFQMTL6W2IW6BB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB/action/storage_attestation","attest_author":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB/action/author_attestation","sign_citation":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB/action/citation_signature","submit_replication":"https://pith.science/pith/AVCYEICJTKZMGFQMTL6W2IW6BB/action/replication_record"}},"created_at":"2026-05-18T03:03:09.351395+00:00","updated_at":"2026-05-18T03:03:09.351395+00:00"}