{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KIUW4G4ISG6NHE7TYY4JA7P5KB","short_pith_number":"pith:KIUW4G4I","schema_version":"1.0","canonical_sha256":"52296e1b8891bcd393f3c638907dfd50722b911da5279dac5bfbfaa951c359f6","source":{"kind":"arxiv","id":"1706.05830","version":1},"attestation_state":"computed","paper":{"title":"Code Constructions based on Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Michael Schelling","submitted_at":"2017-06-19T08:43:02Z","abstract_excerpt":"Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\\mathbb{F}_q$. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed."},"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":"1706.05830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-19T08:43:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d815beda768faad4dc7bccf693e91fd76a2a71e650694d7c98393bd64497c3e3","abstract_canon_sha256":"3c140e6747c3c9bb27b255bf40a45f21e31925d58c7d5d712a9d23de1272e0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.756781Z","signature_b64":"6opTD14XxpX+hwtI1z17Y85EaB9hjKqXCo/GqprNhMV5jqGaNepmzsI42LYJ/TacnsS3qbtzoIGJ/Sy3WL7kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52296e1b8891bcd393f3c638907dfd50722b911da5279dac5bfbfaa951c359f6","last_reissued_at":"2026-05-18T00:42:08.756214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.756214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code Constructions based on Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Michael Schelling","submitted_at":"2017-06-19T08:43:02Z","abstract_excerpt":"Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\\mathbb{F}_q$. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05830","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":"1706.05830","created_at":"2026-05-18T00:42:08.756300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05830v1","created_at":"2026-05-18T00:42:08.756300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05830","created_at":"2026-05-18T00:42:08.756300+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIUW4G4ISG6N","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIUW4G4ISG6NHE7T","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIUW4G4I","created_at":"2026-05-18T12:31:24.725408+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/KIUW4G4ISG6NHE7TYY4JA7P5KB","json":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB.json","graph_json":"https://pith.science/api/pith-number/KIUW4G4ISG6NHE7TYY4JA7P5KB/graph.json","events_json":"https://pith.science/api/pith-number/KIUW4G4ISG6NHE7TYY4JA7P5KB/events.json","paper":"https://pith.science/paper/KIUW4G4I"},"agent_actions":{"view_html":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB","download_json":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB.json","view_paper":"https://pith.science/paper/KIUW4G4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05830&json=true","fetch_graph":"https://pith.science/api/pith-number/KIUW4G4ISG6NHE7TYY4JA7P5KB/graph.json","fetch_events":"https://pith.science/api/pith-number/KIUW4G4ISG6NHE7TYY4JA7P5KB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB/action/storage_attestation","attest_author":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB/action/author_attestation","sign_citation":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB/action/citation_signature","submit_replication":"https://pith.science/pith/KIUW4G4ISG6NHE7TYY4JA7P5KB/action/replication_record"}},"created_at":"2026-05-18T00:42:08.756300+00:00","updated_at":"2026-05-18T00:42:08.756300+00:00"}