{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4AZDJPNW5SR7SFDQBZ343HGWVI","short_pith_number":"pith:4AZDJPNW","schema_version":"1.0","canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","source":{"kind":"arxiv","id":"1601.08227","version":1},"attestation_state":"computed","paper":{"title":"Using Reed-Solomon codes in the $\\left( U\\mid U+V\\right)$ construction and an application to cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Irene M\\'arquez-Corbella, Jean-Pierre Tillich","submitted_at":"2016-01-29T19:30:36Z","abstract_excerpt":"In this paper we present a modification of Reed-Solomon codes that beats the Guruwami-Sudan $1-\\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates $R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate rates in a $\\left( U\\mid U+V\\right)$ construction and to decode them with the Koetter-Vardy soft information decoder. We suggest to use a slightly more general version of these codes (but which has the same decoding performances as the $\\left( U\\mid U+V\\right)$-construction) for code-based cryptography, namely to build a McEliece scheme. The point is here that these "},"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.08227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4fd6c8ba5120946cdc5070c4cd903f748804c146e10a005c7b9a9c845d0dd98e","abstract_canon_sha256":"07c46a9db638522a919f71ffbd9c91ec66b61d24441dbfd284d779931a05672a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.046073Z","signature_b64":"kChd5t5nYUWmfeUCW/E1vU3nXMa0i7Q9mMGoSF5FxTRvb1kOi28sMoRpKNqYSI0dPbDkSluic7zfLiEssv+sAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","last_reissued_at":"2026-05-18T01:21:40.045556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.045556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Reed-Solomon codes in the $\\left( U\\mid U+V\\right)$ construction and an application to cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Irene M\\'arquez-Corbella, Jean-Pierre Tillich","submitted_at":"2016-01-29T19:30:36Z","abstract_excerpt":"In this paper we present a modification of Reed-Solomon codes that beats the Guruwami-Sudan $1-\\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates $R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate rates in a $\\left( U\\mid U+V\\right)$ construction and to decode them with the Koetter-Vardy soft information decoder. We suggest to use a slightly more general version of these codes (but which has the same decoding performances as the $\\left( U\\mid U+V\\right)$-construction) for code-based cryptography, namely to build a McEliece scheme. The point is here that these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08227","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.08227","created_at":"2026-05-18T01:21:40.045641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.08227v1","created_at":"2026-05-18T01:21:40.045641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08227","created_at":"2026-05-18T01:21:40.045641+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AZDJPNW5SR7","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AZDJPNW5SR7SFDQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AZDJPNW","created_at":"2026-05-18T12:29:58.707656+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/4AZDJPNW5SR7SFDQBZ343HGWVI","json":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI.json","graph_json":"https://pith.science/api/pith-number/4AZDJPNW5SR7SFDQBZ343HGWVI/graph.json","events_json":"https://pith.science/api/pith-number/4AZDJPNW5SR7SFDQBZ343HGWVI/events.json","paper":"https://pith.science/paper/4AZDJPNW"},"agent_actions":{"view_html":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI","download_json":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI.json","view_paper":"https://pith.science/paper/4AZDJPNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.08227&json=true","fetch_graph":"https://pith.science/api/pith-number/4AZDJPNW5SR7SFDQBZ343HGWVI/graph.json","fetch_events":"https://pith.science/api/pith-number/4AZDJPNW5SR7SFDQBZ343HGWVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/action/storage_attestation","attest_author":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/action/author_attestation","sign_citation":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/action/citation_signature","submit_replication":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/action/replication_record"}},"created_at":"2026-05-18T01:21:40.045641+00:00","updated_at":"2026-05-18T01:21:40.045641+00:00"}