{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GNP7RJML6V6OKMCCFJTNW426TX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4002e2e04b1ec2cd6b11786bb2980331e3ee94824cd61ca6aad13bee10fcde8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-15T14:48:32Z","title_canon_sha256":"6aacd1f346218921d0ae2ecb2ef1da907b959f67772daf1ac9d2e359d2129040"},"schema_version":"1.0","source":{"id":"1008.2526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2526","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2526v1","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2526","created_at":"2026-05-18T04:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"GNP7RJML6V6O","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GNP7RJML6V6OKMCC","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GNP7RJML","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:d0611b6f6530aebf3e84d4e455280ec02e3c6af255097e8cbf161f1dbb2c8a87","target":"graph","created_at":"2026-05-18T04:42:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field $\\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over $\\mathbb{F}_4$, for number of transmit antennas \\mbox{$N=2^m$}, \\mbox{$m \\geq 1$}, and rates \\mbox{$R>1$} complex symbols per channel use. When \\mbox{$R=N$}, the new STBCs are information-lossless as well. The new class of STBCs have t","authors_text":"B. Sundar Rajan, Lakshmi Prasad Natarajan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-15T14:48:32Z","title":"Low ML Decoding Complexity STBCs via Codes over GF(4)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2526","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23f029d38bb5ea6ceabfc3005ca704593df86e9b739b60467b7a0d2ff2400fe8","target":"record","created_at":"2026-05-18T04:42:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4002e2e04b1ec2cd6b11786bb2980331e3ee94824cd61ca6aad13bee10fcde8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-15T14:48:32Z","title_canon_sha256":"6aacd1f346218921d0ae2ecb2ef1da907b959f67772daf1ac9d2e359d2129040"},"schema_version":"1.0","source":{"id":"1008.2526","kind":"arxiv","version":1}},"canonical_sha256":"335ff8a58bf57ce530422a66db735e9dfa253b9a558a0e8acc5eb259b4dc8a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"335ff8a58bf57ce530422a66db735e9dfa253b9a558a0e8acc5eb259b4dc8a82","first_computed_at":"2026-05-18T04:42:13.112716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:13.112716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nAHBrwU+Rg0LWyE9Jk3w4rYt7RUeuoKYhdp0kvR909qwFc3oysWFtN9660UmUpeoihtwlMUuBxBPdHWAb5gpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:13.113196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23f029d38bb5ea6ceabfc3005ca704593df86e9b739b60467b7a0d2ff2400fe8","sha256:d0611b6f6530aebf3e84d4e455280ec02e3c6af255097e8cbf161f1dbb2c8a87"],"state_sha256":"ccee5a1b532082b39fcbaf15c92ab459b84777745f806eab4ce24b5b30884135"}