{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ACRXRU4EJBPOAVU5LZ5FBL6ZR5","short_pith_number":"pith:ACRXRU4E","schema_version":"1.0","canonical_sha256":"00a378d384485ee0569d5e7a50afd98f5c3ed21392bad3d089165d097149025e","source":{"kind":"arxiv","id":"0706.2310","version":1},"attestation_state":"computed","paper":{"title":"Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph Boutros, Loic Brunel, Nicolas Gresset","submitted_at":"2007-06-15T15:14:01Z","abstract_excerpt":"The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders,"},"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":"0706.2310","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-06-15T15:14:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09eb4707be40ead58a9573393436e5ba37f15581b28716915c93413c70a46b9f","abstract_canon_sha256":"553eb3e2fba1f36537cb4190abd87539ab8884239ddaa7331f556088b99058fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.094472Z","signature_b64":"QMm/7wtgGGZvGCHl9M8oyNpZ4rJBNrqIk6S7K4TZ8P2Mp7YtKFfSDLjZ/5Mw6Po0CEOymoO7BWItgvTJUTSaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a378d384485ee0569d5e7a50afd98f5c3ed21392bad3d089165d097149025e","last_reissued_at":"2026-05-18T00:59:12.093889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.093889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph Boutros, Loic Brunel, Nicolas Gresset","submitted_at":"2007-06-15T15:14:01Z","abstract_excerpt":"The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2310","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":"0706.2310","created_at":"2026-05-18T00:59:12.093993+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.2310v1","created_at":"2026-05-18T00:59:12.093993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2310","created_at":"2026-05-18T00:59:12.093993+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACRXRU4EJBPO","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACRXRU4EJBPOAVU5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACRXRU4E","created_at":"2026-05-18T12:25:55.427421+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/ACRXRU4EJBPOAVU5LZ5FBL6ZR5","json":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5.json","graph_json":"https://pith.science/api/pith-number/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/graph.json","events_json":"https://pith.science/api/pith-number/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/events.json","paper":"https://pith.science/paper/ACRXRU4E"},"agent_actions":{"view_html":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5","download_json":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5.json","view_paper":"https://pith.science/paper/ACRXRU4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.2310&json=true","fetch_graph":"https://pith.science/api/pith-number/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/graph.json","fetch_events":"https://pith.science/api/pith-number/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/action/storage_attestation","attest_author":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/action/author_attestation","sign_citation":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/action/citation_signature","submit_replication":"https://pith.science/pith/ACRXRU4EJBPOAVU5LZ5FBL6ZR5/action/replication_record"}},"created_at":"2026-05-18T00:59:12.093993+00:00","updated_at":"2026-05-18T00:59:12.093993+00:00"}