{"paper":{"title":"Space-time codes with controllable ML decoding complexity for any number of transmit antennas","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Constantinos B. Papadias, Naresh Sharma, Pavan R. Pinnamraju","submitted_at":"2007-01-20T17:27:31Z","abstract_excerpt":"We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can be varied from ML decoding of $2^{\\lceil \\log_2M \\rceil -1}$ symbols together to single symbol ML decoding. For ML decoding of $2^{\\lceil \\log_2M \\rceil - n}$ ($n=1,2,...$) symbols together, a diversity of $\\min(M,2^{\\lceil \\log_2M \\rceil-n+1})$ can be achieved. Numerical results show that the performance of the constructed code when $2^{\\lceil \\log_2M \\rceil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701129","kind":"arxiv","version":2},"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"}