{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QZBJIRJVCMIN3P3HUGWS33ISG6","short_pith_number":"pith:QZBJIRJV","schema_version":"1.0","canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","source":{"kind":"arxiv","id":"1103.1424","version":3},"attestation_state":"computed","paper":{"title":"On the Average Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Walid Abediseid","submitted_at":"2011-03-08T03:05:42Z","abstract_excerpt":"The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that, when the computational complexity exceeds a certain limit, this upper bound becomes dominated by the outage probability achieved by LAST codin"},"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":"1103.1424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f208250d3086919cb4fc69e1657881fbbf21a3ee3a198393f073551263e4466","abstract_canon_sha256":"4152921ecef8393230c570c07e55901aab58717a837031106a57e92287ddb0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:15.330818Z","signature_b64":"f5N3McOz2vbOowhAZZ/BRKentJuE1Rl8htvthyDq424awc8MhccXQ0tNJNrPF+FirEwoiMFFFzCRTLf3BAvKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","last_reissued_at":"2026-05-18T03:54:15.330229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:15.330229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Average Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Walid Abediseid","submitted_at":"2011-03-08T03:05:42Z","abstract_excerpt":"The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that, when the computational complexity exceeds a certain limit, this upper bound becomes dominated by the outage probability achieved by LAST codin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1424","kind":"arxiv","version":3},"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":"1103.1424","created_at":"2026-05-18T03:54:15.330373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1424v3","created_at":"2026-05-18T03:54:15.330373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1424","created_at":"2026-05-18T03:54:15.330373+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZBJIRJVCMIN","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZBJIRJVCMIN3P3H","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZBJIRJV","created_at":"2026-05-18T12:26:39.201973+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/QZBJIRJVCMIN3P3HUGWS33ISG6","json":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6.json","graph_json":"https://pith.science/api/pith-number/QZBJIRJVCMIN3P3HUGWS33ISG6/graph.json","events_json":"https://pith.science/api/pith-number/QZBJIRJVCMIN3P3HUGWS33ISG6/events.json","paper":"https://pith.science/paper/QZBJIRJV"},"agent_actions":{"view_html":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6","download_json":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6.json","view_paper":"https://pith.science/paper/QZBJIRJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1424&json=true","fetch_graph":"https://pith.science/api/pith-number/QZBJIRJVCMIN3P3HUGWS33ISG6/graph.json","fetch_events":"https://pith.science/api/pith-number/QZBJIRJVCMIN3P3HUGWS33ISG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/action/storage_attestation","attest_author":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/action/author_attestation","sign_citation":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/action/citation_signature","submit_replication":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/action/replication_record"}},"created_at":"2026-05-18T03:54:15.330373+00:00","updated_at":"2026-05-18T03:54:15.330373+00:00"}