{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:A4LRLWVVKB4ESSLUMBFHDBAH34","short_pith_number":"pith:A4LRLWVV","schema_version":"1.0","canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","source":{"kind":"arxiv","id":"1112.1593","version":1},"attestation_state":"computed","paper":{"title":"Low-delay, High-rate Non-square Complex Orthogonal Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Smarajit Das","submitted_at":"2011-12-07T15:13:12Z","abstract_excerpt":"The maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\\frac{1}{n}$ if $n$ is even and $1/2+\\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al. (IEEE Trans. Inform. Theory, 2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (IEEE Trans. Inform. Theory, 2007) and it is observed that Liang's construction achieves the bound on delay for $n$ equal to 1 and 3 modulo 4 while Lu et al.'s const"},"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":"1112.1593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T15:13:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac0f4900ca75aa80c1102aebfa41059d5a0813416453964d33b8748cc518cac8","abstract_canon_sha256":"97d9f4c92d175ece2fa7067cffbf5bd4e52d82a51e17f1d243503197666c464b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:54.303171Z","signature_b64":"QZZwbHCfzk1Q4Gx8zYqiDHV9+M6EKfT6KFVBEljZJnq5C/+s1eA2xfgaA2x+z7c1fAZjiAuZfyEDE7SSWCLSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071715dab55078494974604a718407df0e4bb28b1e745d34dbd8064482eeb865","last_reissued_at":"2026-05-18T04:06:54.302755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:54.302755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-delay, High-rate Non-square Complex Orthogonal Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Smarajit Das","submitted_at":"2011-12-07T15:13:12Z","abstract_excerpt":"The maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\\frac{1}{n}$ if $n$ is even and $1/2+\\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al. (IEEE Trans. Inform. Theory, 2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (IEEE Trans. Inform. Theory, 2007) and it is observed that Liang's construction achieves the bound on delay for $n$ equal to 1 and 3 modulo 4 while Lu et al.'s const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1593","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":"1112.1593","created_at":"2026-05-18T04:06:54.302814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1593v1","created_at":"2026-05-18T04:06:54.302814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1593","created_at":"2026-05-18T04:06:54.302814+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4LRLWVVKB4E","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4LRLWVVKB4ESSLU","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4LRLWVV","created_at":"2026-05-18T12:26:24.575870+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/A4LRLWVVKB4ESSLUMBFHDBAH34","json":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34.json","graph_json":"https://pith.science/api/pith-number/A4LRLWVVKB4ESSLUMBFHDBAH34/graph.json","events_json":"https://pith.science/api/pith-number/A4LRLWVVKB4ESSLUMBFHDBAH34/events.json","paper":"https://pith.science/paper/A4LRLWVV"},"agent_actions":{"view_html":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34","download_json":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34.json","view_paper":"https://pith.science/paper/A4LRLWVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1593&json=true","fetch_graph":"https://pith.science/api/pith-number/A4LRLWVVKB4ESSLUMBFHDBAH34/graph.json","fetch_events":"https://pith.science/api/pith-number/A4LRLWVVKB4ESSLUMBFHDBAH34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/action/storage_attestation","attest_author":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/action/author_attestation","sign_citation":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/action/citation_signature","submit_replication":"https://pith.science/pith/A4LRLWVVKB4ESSLUMBFHDBAH34/action/replication_record"}},"created_at":"2026-05-18T04:06:54.302814+00:00","updated_at":"2026-05-18T04:06:54.302814+00:00"}