{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5BKMSU7T5J26TVQAC5CQNAZCEV","short_pith_number":"pith:5BKMSU7T","schema_version":"1.0","canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","source":{"kind":"arxiv","id":"1401.2693","version":2},"attestation_state":"computed","paper":{"title":"On List-decodability of Random Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Ding","submitted_at":"2014-01-13T01:18:04Z","abstract_excerpt":"In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0<R<1$ and $\\epsilon>0$ ($\\epsilon$ and $R$ are independent), if $0<\\frac{n}{m}\\leq \\epsilon$, then with high probability a random rank metric code in $F_{q}^{m\\times n}$ of rate $R$ can be list-decoded up to a fraction $(1-R-\\epsilon)$ of rank errors with constant list size $L$ satisfying $L\\leq O(1/\\epsilon)$. Moreover, if $\\frac{n}{m}\\geq\\Theta_R(\\epsilon)$, any rank metric code in $F_{q}^{m\\times n}$ with rate $R$ and decoding radius $"},"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":"1401.2693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"766fcb849c6f786c4aec8a5aa81ac410e5d9801873b4a58fbff0f5f3a1f6e018","abstract_canon_sha256":"a91578d43fad3e357f3119c6781aa787e702324b23e96a628ec9fba5108198a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.869643Z","signature_b64":"KO7jAYjyWK1LAllypqv7zoEkj7qrN+ULNUMCmqgf5qL1cYxJVwbr36mEAIrH4+miPVF35qMaxBB8/T20CbXXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","last_reissued_at":"2026-05-18T03:01:23.868991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.868991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On List-decodability of Random Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Ding","submitted_at":"2014-01-13T01:18:04Z","abstract_excerpt":"In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0<R<1$ and $\\epsilon>0$ ($\\epsilon$ and $R$ are independent), if $0<\\frac{n}{m}\\leq \\epsilon$, then with high probability a random rank metric code in $F_{q}^{m\\times n}$ of rate $R$ can be list-decoded up to a fraction $(1-R-\\epsilon)$ of rank errors with constant list size $L$ satisfying $L\\leq O(1/\\epsilon)$. Moreover, if $\\frac{n}{m}\\geq\\Theta_R(\\epsilon)$, any rank metric code in $F_{q}^{m\\times n}$ with rate $R$ and decoding radius $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2693","kind":"arxiv","version":2},"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":"1401.2693","created_at":"2026-05-18T03:01:23.869082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2693v2","created_at":"2026-05-18T03:01:23.869082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2693","created_at":"2026-05-18T03:01:23.869082+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BKMSU7T5J26","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BKMSU7T5J26TVQA","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BKMSU7T","created_at":"2026-05-18T12:28:14.216126+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/5BKMSU7T5J26TVQAC5CQNAZCEV","json":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV.json","graph_json":"https://pith.science/api/pith-number/5BKMSU7T5J26TVQAC5CQNAZCEV/graph.json","events_json":"https://pith.science/api/pith-number/5BKMSU7T5J26TVQAC5CQNAZCEV/events.json","paper":"https://pith.science/paper/5BKMSU7T"},"agent_actions":{"view_html":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV","download_json":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV.json","view_paper":"https://pith.science/paper/5BKMSU7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2693&json=true","fetch_graph":"https://pith.science/api/pith-number/5BKMSU7T5J26TVQAC5CQNAZCEV/graph.json","fetch_events":"https://pith.science/api/pith-number/5BKMSU7T5J26TVQAC5CQNAZCEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/action/storage_attestation","attest_author":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/action/author_attestation","sign_citation":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/action/citation_signature","submit_replication":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/action/replication_record"}},"created_at":"2026-05-18T03:01:23.869082+00:00","updated_at":"2026-05-18T03:01:23.869082+00:00"}