{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:TKPZELTBQIXDWLVMHLAIHOYKJ5","short_pith_number":"pith:TKPZELTB","schema_version":"1.0","canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","source":{"kind":"arxiv","id":"0704.2505","version":1},"attestation_state":"computed","paper":{"title":"Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. Susinder Rajan","submitted_at":"2007-04-19T11:05:31Z","abstract_excerpt":"\"Extended Clifford algebras\" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decodin"},"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":"0704.2505","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"24fbcae45103c367718c9c9fc6f318c94d18e4936a177d1f33a1755d5034c08e","abstract_canon_sha256":"b9860d618368c45b52a467072c1e6d49468a0a01bdab4b126c893e5e86a7d52f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.248591Z","signature_b64":"CuFkJpDUmVQtfSz8F444wYV/TaQoSbnm0owJBob6VlsJvdkWEPNvJXibEvAbePxCBQprrgQwwcdnJZhlIGglBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","last_reissued_at":"2026-05-18T00:58:26.248085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.248085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. Susinder Rajan","submitted_at":"2007-04-19T11:05:31Z","abstract_excerpt":"\"Extended Clifford algebras\" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decodin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2505","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":"0704.2505","created_at":"2026-05-18T00:58:26.248156+00:00"},{"alias_kind":"arxiv_version","alias_value":"0704.2505v1","created_at":"2026-05-18T00:58:26.248156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2505","created_at":"2026-05-18T00:58:26.248156+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKPZELTBQIXD","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKPZELTBQIXDWLVM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKPZELTB","created_at":"2026-05-18T12:25:56.245647+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/TKPZELTBQIXDWLVMHLAIHOYKJ5","json":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5.json","graph_json":"https://pith.science/api/pith-number/TKPZELTBQIXDWLVMHLAIHOYKJ5/graph.json","events_json":"https://pith.science/api/pith-number/TKPZELTBQIXDWLVMHLAIHOYKJ5/events.json","paper":"https://pith.science/paper/TKPZELTB"},"agent_actions":{"view_html":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5","download_json":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5.json","view_paper":"https://pith.science/paper/TKPZELTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0704.2505&json=true","fetch_graph":"https://pith.science/api/pith-number/TKPZELTBQIXDWLVMHLAIHOYKJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/TKPZELTBQIXDWLVMHLAIHOYKJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/action/storage_attestation","attest_author":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/action/author_attestation","sign_citation":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/action/citation_signature","submit_replication":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/action/replication_record"}},"created_at":"2026-05-18T00:58:26.248156+00:00","updated_at":"2026-05-18T00:58:26.248156+00:00"}