{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:26R5VFJKSJKVGJ2W64VZJZTZH2","short_pith_number":"pith:26R5VFJK","schema_version":"1.0","canonical_sha256":"d7a3da952a9255532756f72b94e6793ea743bb9cf6356229bdeef5e51c2a9f47","source":{"kind":"arxiv","id":"1403.2499","version":1},"attestation_state":"computed","paper":{"title":"Application of Constacyclic codes to Quantum MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Guanghui Zhang, San Ling","submitted_at":"2014-03-11T08:39:08Z","abstract_excerpt":"Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\\mathbb{F}_{q^2}$ satisfying $C^{\\perp_H}\\subseteq C$ by the Hermitian construction and the quantum Singleton bound. If $C^{\\perp_{H}}\\subseteq C$, we say that $C$ is a dual-containing code. Many new quantum MDS codes with relatively large minimum distance have been produced by constructing dual-containing constacyclic MDS codes (see \\cite{Guardia11}, \\cite{Kai13}, \\cite{Kai14}). These works motivate us to make a careful study"},"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":"1403.2499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-11T08:39:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ebf38d0769a7d4dbd52f25d53834bb585f73346668e1f770ce1ee59dbfc9747","abstract_canon_sha256":"1e3383a1ceae9e00f6db8bbb6a6a92b0d393b0ffc5c37a82ecfe16540aef0dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:43.175397Z","signature_b64":"o7vKhE9yi9HBxj6wSjm4TQx4LZktDKiB8P5NO8xi+Te49k0SxPb7QSB0qCRucxxd1ILj8j8zuVkpQBNm/XL1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7a3da952a9255532756f72b94e6793ea743bb9cf6356229bdeef5e51c2a9f47","last_reissued_at":"2026-05-18T02:56:43.175010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:43.175010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application of Constacyclic codes to Quantum MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Guanghui Zhang, San Ling","submitted_at":"2014-03-11T08:39:08Z","abstract_excerpt":"Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\\mathbb{F}_{q^2}$ satisfying $C^{\\perp_H}\\subseteq C$ by the Hermitian construction and the quantum Singleton bound. If $C^{\\perp_{H}}\\subseteq C$, we say that $C$ is a dual-containing code. Many new quantum MDS codes with relatively large minimum distance have been produced by constructing dual-containing constacyclic MDS codes (see \\cite{Guardia11}, \\cite{Kai13}, \\cite{Kai14}). These works motivate us to make a careful study"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2499","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":"1403.2499","created_at":"2026-05-18T02:56:43.175065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2499v1","created_at":"2026-05-18T02:56:43.175065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2499","created_at":"2026-05-18T02:56:43.175065+00:00"},{"alias_kind":"pith_short_12","alias_value":"26R5VFJKSJKV","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"26R5VFJKSJKVGJ2W","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"26R5VFJK","created_at":"2026-05-18T12:28:09.283467+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/26R5VFJKSJKVGJ2W64VZJZTZH2","json":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2.json","graph_json":"https://pith.science/api/pith-number/26R5VFJKSJKVGJ2W64VZJZTZH2/graph.json","events_json":"https://pith.science/api/pith-number/26R5VFJKSJKVGJ2W64VZJZTZH2/events.json","paper":"https://pith.science/paper/26R5VFJK"},"agent_actions":{"view_html":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2","download_json":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2.json","view_paper":"https://pith.science/paper/26R5VFJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2499&json=true","fetch_graph":"https://pith.science/api/pith-number/26R5VFJKSJKVGJ2W64VZJZTZH2/graph.json","fetch_events":"https://pith.science/api/pith-number/26R5VFJKSJKVGJ2W64VZJZTZH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2/action/storage_attestation","attest_author":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2/action/author_attestation","sign_citation":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2/action/citation_signature","submit_replication":"https://pith.science/pith/26R5VFJKSJKVGJ2W64VZJZTZH2/action/replication_record"}},"created_at":"2026-05-18T02:56:43.175065+00:00","updated_at":"2026-05-18T02:56:43.175065+00:00"}