{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3IMVER5MRHSDCVNVPBXJ75Z7QA","short_pith_number":"pith:3IMVER5M","schema_version":"1.0","canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","source":{"kind":"arxiv","id":"1501.06686","version":1},"attestation_state":"computed","paper":{"title":"Reduced Complexity Decoding of n x n Algebraic Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk","submitted_at":"2015-01-27T08:31:38Z","abstract_excerpt":"Algebraic space-time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space-time codes in Maximum-Likelihood (ML) decoding, but well-performing and widely-used codes such as the Golden code often suffer from high ML-decoding complexity. In this article, a recursive algorithm for decoding general algebraic space-time codes of arbitrary dimension is proposed, which reduces the worst-case decoding complexity from $O(|S|^{n^2})$ to $O(|S|^n)$."},"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":"1501.06686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab6d585d253650ca3b0ac33f951457ea9692e142180e418f5e39338226ddea64","abstract_canon_sha256":"b14697ff0861c30380635635cc5ef7add4efe296e32504fa88830fc96ec4cb5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.352983Z","signature_b64":"xjKH/EiG2+XnDYUJk1vPhX8gtgjF7QGKbTD021OpM958bspSU3PJonE4qOVdQ65AGtht2b5umRBhT7w2bZZmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","last_reissued_at":"2026-05-18T02:28:39.352425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.352425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced Complexity Decoding of n x n Algebraic Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk","submitted_at":"2015-01-27T08:31:38Z","abstract_excerpt":"Algebraic space-time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space-time codes in Maximum-Likelihood (ML) decoding, but well-performing and widely-used codes such as the Golden code often suffer from high ML-decoding complexity. In this article, a recursive algorithm for decoding general algebraic space-time codes of arbitrary dimension is proposed, which reduces the worst-case decoding complexity from $O(|S|^{n^2})$ to $O(|S|^n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06686","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":"1501.06686","created_at":"2026-05-18T02:28:39.352527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06686v1","created_at":"2026-05-18T02:28:39.352527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06686","created_at":"2026-05-18T02:28:39.352527+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IMVER5MRHSD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IMVER5MRHSDCVNV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IMVER5M","created_at":"2026-05-18T12:29:02.477457+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/3IMVER5MRHSDCVNVPBXJ75Z7QA","json":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA.json","graph_json":"https://pith.science/api/pith-number/3IMVER5MRHSDCVNVPBXJ75Z7QA/graph.json","events_json":"https://pith.science/api/pith-number/3IMVER5MRHSDCVNVPBXJ75Z7QA/events.json","paper":"https://pith.science/paper/3IMVER5M"},"agent_actions":{"view_html":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA","download_json":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA.json","view_paper":"https://pith.science/paper/3IMVER5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06686&json=true","fetch_graph":"https://pith.science/api/pith-number/3IMVER5MRHSDCVNVPBXJ75Z7QA/graph.json","fetch_events":"https://pith.science/api/pith-number/3IMVER5MRHSDCVNVPBXJ75Z7QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/action/storage_attestation","attest_author":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/action/author_attestation","sign_citation":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/action/citation_signature","submit_replication":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/action/replication_record"}},"created_at":"2026-05-18T02:28:39.352527+00:00","updated_at":"2026-05-18T02:28:39.352527+00:00"}