{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2PIRRKATDNOJGAUIODKKFBSDZY","short_pith_number":"pith:2PIRRKAT","schema_version":"1.0","canonical_sha256":"d3d118a8131b5c93028870d4a28643ce0881a96f78253926823c46d9dc29c98d","source":{"kind":"arxiv","id":"1605.05716","version":3},"attestation_state":"computed","paper":{"title":"Space-Time Codes Based on Rank-Metric Codes and Their Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Robert F. H. Fischer, Sebastian Stern, Sven Puchinger","submitted_at":"2016-05-18T19:38:01Z","abstract_excerpt":"We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order and improve upon certain existing constructions. Moreover, we present a new decoding algorithm for these codes which utilizes the algebraic structure of the underlying finite-field rank-metric codes and employs lattice-reduction-aided equalization. This decoder does not achieve the same performance as the classical maximum-likelihood decoding methods, but has "},"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":"1605.05716","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T19:38:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8dea332fb328127832cf53b682ab0a1e82c13c26e7a4afd2410741755366085","abstract_canon_sha256":"b2ddbfa0aca28be0cb422398ebd4f9834519b95fe519b375df52926bf4793d30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.817932Z","signature_b64":"Ki5T/FbAWGjfJO/c/Cz6tDU5caq95+Ta/UW4V2DDnfWuUvmkaoAzF/e+OWldWyhW114K7gaCGsUQuQscptVkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3d118a8131b5c93028870d4a28643ce0881a96f78253926823c46d9dc29c98d","last_reissued_at":"2026-05-18T00:43:35.817576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.817576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Time Codes Based on Rank-Metric Codes and Their Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Robert F. H. Fischer, Sebastian Stern, Sven Puchinger","submitted_at":"2016-05-18T19:38:01Z","abstract_excerpt":"We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order and improve upon certain existing constructions. Moreover, we present a new decoding algorithm for these codes which utilizes the algebraic structure of the underlying finite-field rank-metric codes and employs lattice-reduction-aided equalization. This decoder does not achieve the same performance as the classical maximum-likelihood decoding methods, but has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05716","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":"1605.05716","created_at":"2026-05-18T00:43:35.817635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05716v3","created_at":"2026-05-18T00:43:35.817635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05716","created_at":"2026-05-18T00:43:35.817635+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PIRRKATDNOJ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PIRRKATDNOJGAUI","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PIRRKAT","created_at":"2026-05-18T12:29:55.572404+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/2PIRRKATDNOJGAUIODKKFBSDZY","json":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY.json","graph_json":"https://pith.science/api/pith-number/2PIRRKATDNOJGAUIODKKFBSDZY/graph.json","events_json":"https://pith.science/api/pith-number/2PIRRKATDNOJGAUIODKKFBSDZY/events.json","paper":"https://pith.science/paper/2PIRRKAT"},"agent_actions":{"view_html":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY","download_json":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY.json","view_paper":"https://pith.science/paper/2PIRRKAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05716&json=true","fetch_graph":"https://pith.science/api/pith-number/2PIRRKATDNOJGAUIODKKFBSDZY/graph.json","fetch_events":"https://pith.science/api/pith-number/2PIRRKATDNOJGAUIODKKFBSDZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY/action/storage_attestation","attest_author":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY/action/author_attestation","sign_citation":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY/action/citation_signature","submit_replication":"https://pith.science/pith/2PIRRKATDNOJGAUIODKKFBSDZY/action/replication_record"}},"created_at":"2026-05-18T00:43:35.817635+00:00","updated_at":"2026-05-18T00:43:35.817635+00:00"}