{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DZXMCQCPBNBQ37WEG3HTIZVD6U","short_pith_number":"pith:DZXMCQCP","schema_version":"1.0","canonical_sha256":"1e6ec1404f0b430dfec436cf3466a3f52750d380a8f0d916402a8116a75212a7","source":{"kind":"arxiv","id":"1502.05267","version":1},"attestation_state":"computed","paper":{"title":"Quantum MDS Codes over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Markus Grassl, Martin Roetteler","submitted_at":"2015-02-18T15:11:59Z","abstract_excerpt":"We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound $n_0(q,d)$ on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length $q^2+2$, where $q=2"},"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":"1502.05267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-02-18T15:11:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f9518febe3175344d89d86cf247a959a6482693e2f6409f365ce455a2c90f264","abstract_canon_sha256":"2f17b0e4d985be292611a39a3a3715dbc0b3b813d687e010831b93d9b8b3075c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:10.498332Z","signature_b64":"309ZHzJ/qGMOXsWlRh/VMZDjd2kIITAGSuxXCiHlaU/CUd4U+E8ZikujEsgShWdfSKhRbnbzs8y2uDfsByxnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e6ec1404f0b430dfec436cf3466a3f52750d380a8f0d916402a8116a75212a7","last_reissued_at":"2026-05-18T01:22:10.497712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:10.497712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum MDS Codes over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Markus Grassl, Martin Roetteler","submitted_at":"2015-02-18T15:11:59Z","abstract_excerpt":"We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound $n_0(q,d)$ on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length $q^2+2$, where $q=2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05267","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":"1502.05267","created_at":"2026-05-18T01:22:10.497802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05267v1","created_at":"2026-05-18T01:22:10.497802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05267","created_at":"2026-05-18T01:22:10.497802+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZXMCQCPBNBQ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZXMCQCPBNBQ37WE","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZXMCQCP","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05781","citing_title":"Symmetry-guided constructions of absolutely maximally entangled states in five open cases","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U","json":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U.json","graph_json":"https://pith.science/api/pith-number/DZXMCQCPBNBQ37WEG3HTIZVD6U/graph.json","events_json":"https://pith.science/api/pith-number/DZXMCQCPBNBQ37WEG3HTIZVD6U/events.json","paper":"https://pith.science/paper/DZXMCQCP"},"agent_actions":{"view_html":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U","download_json":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U.json","view_paper":"https://pith.science/paper/DZXMCQCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05267&json=true","fetch_graph":"https://pith.science/api/pith-number/DZXMCQCPBNBQ37WEG3HTIZVD6U/graph.json","fetch_events":"https://pith.science/api/pith-number/DZXMCQCPBNBQ37WEG3HTIZVD6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U/action/storage_attestation","attest_author":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U/action/author_attestation","sign_citation":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U/action/citation_signature","submit_replication":"https://pith.science/pith/DZXMCQCPBNBQ37WEG3HTIZVD6U/action/replication_record"}},"created_at":"2026-05-18T01:22:10.497802+00:00","updated_at":"2026-05-18T01:22:10.497802+00:00"}