{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OXYBRVBERQUOHKXCB3NG7OPRUV","short_pith_number":"pith:OXYBRVBE","schema_version":"1.0","canonical_sha256":"75f018d4248c28e3aae20eda6fb9f1a56b20695b62314e1260b761336b5938fb","source":{"kind":"arxiv","id":"1601.04507","version":1},"attestation_state":"computed","paper":{"title":"On MDS convolutional Codes over $\\mathbb Z_{p^r}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Diego Napp, Marisa Toste, Raquel Pinto","submitted_at":"2016-01-18T13:35:36Z","abstract_excerpt":"Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in [26] via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Z p r from a new perspective. We introduce the notions of p-standard form and r- optimal parameters to derive a novel upper bound of Singleton type on the free distance. Moreover, we present a constructive method for building gener"},"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":"1601.04507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:35:36Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"a035803f38a2d7ee8b1db1ac9061ae5e8a91e5328a13bdbecea6023ccedf9cf8","abstract_canon_sha256":"72d99da9c74d40d424894280e76d6e66bdeacbd9d010f771f91eb57b88d797d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.846025Z","signature_b64":"7EQC9OJFag1PKFaPxT2VEeX8H0XMQza0+nnTMoTaRjUJMvz50g/qfMlgnH1M95IcwaVQ+4b37DsgPbucpt2OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f018d4248c28e3aae20eda6fb9f1a56b20695b62314e1260b761336b5938fb","last_reissued_at":"2026-05-18T01:22:44.845475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.845475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On MDS convolutional Codes over $\\mathbb Z_{p^r}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Diego Napp, Marisa Toste, Raquel Pinto","submitted_at":"2016-01-18T13:35:36Z","abstract_excerpt":"Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in [26] via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Z p r from a new perspective. We introduce the notions of p-standard form and r- optimal parameters to derive a novel upper bound of Singleton type on the free distance. Moreover, we present a constructive method for building gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04507","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":"1601.04507","created_at":"2026-05-18T01:22:44.845559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04507v1","created_at":"2026-05-18T01:22:44.845559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04507","created_at":"2026-05-18T01:22:44.845559+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXYBRVBERQUO","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXYBRVBERQUOHKXC","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXYBRVBE","created_at":"2026-05-18T12:30:36.002864+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/OXYBRVBERQUOHKXCB3NG7OPRUV","json":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV.json","graph_json":"https://pith.science/api/pith-number/OXYBRVBERQUOHKXCB3NG7OPRUV/graph.json","events_json":"https://pith.science/api/pith-number/OXYBRVBERQUOHKXCB3NG7OPRUV/events.json","paper":"https://pith.science/paper/OXYBRVBE"},"agent_actions":{"view_html":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV","download_json":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV.json","view_paper":"https://pith.science/paper/OXYBRVBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04507&json=true","fetch_graph":"https://pith.science/api/pith-number/OXYBRVBERQUOHKXCB3NG7OPRUV/graph.json","fetch_events":"https://pith.science/api/pith-number/OXYBRVBERQUOHKXCB3NG7OPRUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV/action/storage_attestation","attest_author":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV/action/author_attestation","sign_citation":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV/action/citation_signature","submit_replication":"https://pith.science/pith/OXYBRVBERQUOHKXCB3NG7OPRUV/action/replication_record"}},"created_at":"2026-05-18T01:22:44.845559+00:00","updated_at":"2026-05-18T01:22:44.845559+00:00"}