{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VCB2GBTL6YB7QAUIRQEQ4I4FEU","short_pith_number":"pith:VCB2GBTL","schema_version":"1.0","canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","source":{"kind":"arxiv","id":"1411.5822","version":1},"attestation_state":"computed","paper":{"title":"On the Classification of MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2014-11-21T10:51:53Z","abstract_excerpt":"A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified. It is shown that every $(k+d-1,q^k,d)_q$ code with $k\\geq 3$, $d \\geq 3$, $q \\in \\{5,7\\}$ is equivalent to a linear code with the same parameters. This implies that the $(6,5^4,3)_5$ code and the $(n,7^{n-2},3)_7$ MDS codes for $n\\in\\{6,7,8\\}$ are unique. The classification of one-error-correcting $8$-ary MDS codes is also finished; there are $14$, $8$, $4$"},"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":"1411.5822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-21T10:51:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"734f438547624151aee616864fe30399d2c8350fb2064681f3c2a08b9c88cdae","abstract_canon_sha256":"1989faed75dbfcb25a94a9addb62beb84fc3a213efb3f6b86eedbc1c5a2fc3e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:20.266068Z","signature_b64":"5I1yGRVr0dDVZV/HjpXcpmRSngtc+MIBKAkR3e7xB5ILFhp+8Dg0xotr/4Lt164nDjVfRhVLKbsIt+0+GRRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a883a3066bf603f802888c090e23852515b9565a69cd0ff6736fc8e3c3039aed","last_reissued_at":"2026-05-18T01:24:20.265657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:20.265657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Classification of MDS Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Denis S. Krotov, Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2014-11-21T10:51:53Z","abstract_excerpt":"A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified. It is shown that every $(k+d-1,q^k,d)_q$ code with $k\\geq 3$, $d \\geq 3$, $q \\in \\{5,7\\}$ is equivalent to a linear code with the same parameters. This implies that the $(6,5^4,3)_5$ code and the $(n,7^{n-2},3)_7$ MDS codes for $n\\in\\{6,7,8\\}$ are unique. The classification of one-error-correcting $8$-ary MDS codes is also finished; there are $14$, $8$, $4$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5822","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":"1411.5822","created_at":"2026-05-18T01:24:20.265715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5822v1","created_at":"2026-05-18T01:24:20.265715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5822","created_at":"2026-05-18T01:24:20.265715+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCB2GBTL6YB7","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCB2GBTL6YB7QAUI","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCB2GBTL","created_at":"2026-05-18T12:28:52.271510+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/VCB2GBTL6YB7QAUIRQEQ4I4FEU","json":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU.json","graph_json":"https://pith.science/api/pith-number/VCB2GBTL6YB7QAUIRQEQ4I4FEU/graph.json","events_json":"https://pith.science/api/pith-number/VCB2GBTL6YB7QAUIRQEQ4I4FEU/events.json","paper":"https://pith.science/paper/VCB2GBTL"},"agent_actions":{"view_html":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU","download_json":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU.json","view_paper":"https://pith.science/paper/VCB2GBTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5822&json=true","fetch_graph":"https://pith.science/api/pith-number/VCB2GBTL6YB7QAUIRQEQ4I4FEU/graph.json","fetch_events":"https://pith.science/api/pith-number/VCB2GBTL6YB7QAUIRQEQ4I4FEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/action/storage_attestation","attest_author":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/action/author_attestation","sign_citation":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/action/citation_signature","submit_replication":"https://pith.science/pith/VCB2GBTL6YB7QAUIRQEQ4I4FEU/action/replication_record"}},"created_at":"2026-05-18T01:24:20.265715+00:00","updated_at":"2026-05-18T01:24:20.265715+00:00"}