{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ZIV57FRR2VUKMA63AK3JAQ2K5C","short_pith_number":"pith:ZIV57FRR","schema_version":"1.0","canonical_sha256":"ca2bdf9631d568a603db02b690434ae8922773a6da14e2530970193baa215d60","source":{"kind":"arxiv","id":"0707.4311","version":1},"attestation_state":"computed","paper":{"title":"Embedded Rank Distance Codes for ISI channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. R. Calderbank, S. Dusad, S. N. Diggavi","submitted_at":"2007-07-29T20:47:57Z","abstract_excerpt":"Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the"},"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":"0707.4311","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-29T20:47:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"feffd2f27fc25140a13408cacdca5bc09c19b26be7ff8e7b0d7a8876cfefb908","abstract_canon_sha256":"e0a8c491795b6bf9e9d5ee328eb882f570b5f80167deb4018283e2282d2d58cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.862105Z","signature_b64":"U/E++TBuXZZyehpbo2K2rg/FQf9aLxOJ7W3ZCG08uei3qXruTxdBnq0f/Bw92UJ+LscCvf9PDAAdsQlr1BaZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca2bdf9631d568a603db02b690434ae8922773a6da14e2530970193baa215d60","last_reissued_at":"2026-05-18T00:57:58.861573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.861573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedded Rank Distance Codes for ISI channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. R. Calderbank, S. Dusad, S. N. Diggavi","submitted_at":"2007-07-29T20:47:57Z","abstract_excerpt":"Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.4311","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":"0707.4311","created_at":"2026-05-18T00:57:58.861650+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.4311v1","created_at":"2026-05-18T00:57:58.861650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.4311","created_at":"2026-05-18T00:57:58.861650+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIV57FRR2VUK","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIV57FRR2VUKMA63","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIV57FRR","created_at":"2026-05-18T12:25:56.245647+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/ZIV57FRR2VUKMA63AK3JAQ2K5C","json":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C.json","graph_json":"https://pith.science/api/pith-number/ZIV57FRR2VUKMA63AK3JAQ2K5C/graph.json","events_json":"https://pith.science/api/pith-number/ZIV57FRR2VUKMA63AK3JAQ2K5C/events.json","paper":"https://pith.science/paper/ZIV57FRR"},"agent_actions":{"view_html":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C","download_json":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C.json","view_paper":"https://pith.science/paper/ZIV57FRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.4311&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIV57FRR2VUKMA63AK3JAQ2K5C/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIV57FRR2VUKMA63AK3JAQ2K5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C/action/storage_attestation","attest_author":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C/action/author_attestation","sign_citation":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C/action/citation_signature","submit_replication":"https://pith.science/pith/ZIV57FRR2VUKMA63AK3JAQ2K5C/action/replication_record"}},"created_at":"2026-05-18T00:57:58.861650+00:00","updated_at":"2026-05-18T00:57:58.861650+00:00"}