{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QHCDILUC6V27YXP2LTIXIEGT7T","short_pith_number":"pith:QHCDILUC","schema_version":"1.0","canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","source":{"kind":"arxiv","id":"1312.7650","version":3},"attestation_state":"computed","paper":{"title":"On the Minimum Decoding Delay of Balanced Complex Orthogonal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, XiaoDong Liu, Yuan Li","submitted_at":"2013-12-30T08:43:59Z","abstract_excerpt":"Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$ COD called balanced complex orthogonal design (BCOD) has been proposed by Adams et al., and they constructed BCODs with rate $k/p = 1/2$ and decoding delay $p = 2^m$ for $n=2m$. Furthermore, they prove that the constructions have optimal decoding delay when $m$ is congruent to $1$, $2$, or $3$ module $4$. They conjecture that for the case $m \\equiv 0 \\pmod 4$,"},"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":"1312.7650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T08:43:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be1e9ffade774d653e26d8bf3824a8b498ecd0188c3d985b02c956604cbb0308","abstract_canon_sha256":"abb99d4361954fd465bfb25b1bf5cb549f046c756e88446d9c884881504ac8a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.555039Z","signature_b64":"uRdtOND+kUaVfr8ZDFxahfjf3JiYErxoEyszCEA8Oqh5sc18KSespZBFl5UR+dMtB89/21fZg+6Y5ihVjUelDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c4342e82f575fc5dfa5cd17410d3fcc6f1fb90910b720c12bfcdb38769d3de","last_reissued_at":"2026-05-18T01:04:30.554307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.554307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimum Decoding Delay of Balanced Complex Orthogonal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haibin Kan, XiaoDong Liu, Yuan Li","submitted_at":"2013-12-30T08:43:59Z","abstract_excerpt":"Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$ COD called balanced complex orthogonal design (BCOD) has been proposed by Adams et al., and they constructed BCODs with rate $k/p = 1/2$ and decoding delay $p = 2^m$ for $n=2m$. Furthermore, they prove that the constructions have optimal decoding delay when $m$ is congruent to $1$, $2$, or $3$ module $4$. They conjecture that for the case $m \\equiv 0 \\pmod 4$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7650","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":"1312.7650","created_at":"2026-05-18T01:04:30.554440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7650v3","created_at":"2026-05-18T01:04:30.554440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7650","created_at":"2026-05-18T01:04:30.554440+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHCDILUC6V27","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHCDILUC6V27YXP2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHCDILUC","created_at":"2026-05-18T12:27:57.521954+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/QHCDILUC6V27YXP2LTIXIEGT7T","json":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T.json","graph_json":"https://pith.science/api/pith-number/QHCDILUC6V27YXP2LTIXIEGT7T/graph.json","events_json":"https://pith.science/api/pith-number/QHCDILUC6V27YXP2LTIXIEGT7T/events.json","paper":"https://pith.science/paper/QHCDILUC"},"agent_actions":{"view_html":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T","download_json":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T.json","view_paper":"https://pith.science/paper/QHCDILUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7650&json=true","fetch_graph":"https://pith.science/api/pith-number/QHCDILUC6V27YXP2LTIXIEGT7T/graph.json","fetch_events":"https://pith.science/api/pith-number/QHCDILUC6V27YXP2LTIXIEGT7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/action/storage_attestation","attest_author":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/action/author_attestation","sign_citation":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/action/citation_signature","submit_replication":"https://pith.science/pith/QHCDILUC6V27YXP2LTIXIEGT7T/action/replication_record"}},"created_at":"2026-05-18T01:04:30.554440+00:00","updated_at":"2026-05-18T01:04:30.554440+00:00"}