{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K3ZJC3CF4O4QOV6KNHJAQNQM5M","short_pith_number":"pith:K3ZJC3CF","schema_version":"1.0","canonical_sha256":"56f2916c45e3b90757ca69d208360ceb2466fc72d79aba56eeaebbd048366d1c","source":{"kind":"arxiv","id":"1102.4186","version":3},"attestation_state":"computed","paper":{"title":"Improved decoding of affine-variety codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala","submitted_at":"2011-02-21T10:51:01Z","abstract_excerpt":"General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian "},"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":"1102.4186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-21T10:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"0b785700a6c8861e16d4edbfc2639fee00e6e7dc425ace3ee94be52e3f74733d","abstract_canon_sha256":"a79d92a6bd5719aadf8bd3ce157299228957ce612cc12bfc2f3987226c5c0483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:00.670307Z","signature_b64":"RGltVRkkBux7kucLVdUXeSKMjmys1CeUZpYAgD+SCdenJO8hfPJ1ht2NJbRbnc69X7u2TtiQmZhmVd3vzv0DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56f2916c45e3b90757ca69d208360ceb2466fc72d79aba56eeaebbd048366d1c","last_reissued_at":"2026-05-18T01:18:00.669626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:00.669626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved decoding of affine-variety codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala","submitted_at":"2011-02-21T10:51:01Z","abstract_excerpt":"General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4186","kind":"arxiv","version":3},"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":"1102.4186","created_at":"2026-05-18T01:18:00.669735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4186v3","created_at":"2026-05-18T01:18:00.669735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4186","created_at":"2026-05-18T01:18:00.669735+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3ZJC3CF4O4Q","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3ZJC3CF4O4QOV6K","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3ZJC3CF","created_at":"2026-05-18T12:26:32.869790+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/K3ZJC3CF4O4QOV6KNHJAQNQM5M","json":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M.json","graph_json":"https://pith.science/api/pith-number/K3ZJC3CF4O4QOV6KNHJAQNQM5M/graph.json","events_json":"https://pith.science/api/pith-number/K3ZJC3CF4O4QOV6KNHJAQNQM5M/events.json","paper":"https://pith.science/paper/K3ZJC3CF"},"agent_actions":{"view_html":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M","download_json":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M.json","view_paper":"https://pith.science/paper/K3ZJC3CF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4186&json=true","fetch_graph":"https://pith.science/api/pith-number/K3ZJC3CF4O4QOV6KNHJAQNQM5M/graph.json","fetch_events":"https://pith.science/api/pith-number/K3ZJC3CF4O4QOV6KNHJAQNQM5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M/action/storage_attestation","attest_author":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M/action/author_attestation","sign_citation":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M/action/citation_signature","submit_replication":"https://pith.science/pith/K3ZJC3CF4O4QOV6KNHJAQNQM5M/action/replication_record"}},"created_at":"2026-05-18T01:18:00.669735+00:00","updated_at":"2026-05-18T01:18:00.669735+00:00"}