{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NPGELVN2UCZIVWOTLI37OKG4AZ","short_pith_number":"pith:NPGELVN2","schema_version":"1.0","canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","source":{"kind":"arxiv","id":"1210.0083","version":1},"attestation_state":"computed","paper":{"title":"Decoding a Class of Affine Variety Codes with Fast DFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.AC","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hajime Matsui","submitted_at":"2012-09-29T06:18:34Z","abstract_excerpt":"An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity of error-value calculations in our algorithm improves that in solving systems of linear equations from error correcting pairs in many cases. A motivating example of our algorithm in case of a Reed-"},"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":"1210.0083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","cross_cats_sorted":["cs.DM","math.AC","math.AG","math.IT"],"title_canon_sha256":"cf7398e9c1a99d31a7b5817b45c435b3d6b68399f49c035c680718f5aaf5fab5","abstract_canon_sha256":"a1279ebbc875b7ef9cced9b815bec57153c3ba7c9ae493d8e2b6b50f5d2e722f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.361465Z","signature_b64":"0veaQRMkBV9icVqh/ce4BNlUrDqMzG1a5LYqJo9e4W+D40ecMzXM6oskIsO9uFQqVSq9GnBhkGmP0mKXlF6bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","last_reissued_at":"2026-05-18T03:44:23.360978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.360978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding a Class of Affine Variety Codes with Fast DFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.AC","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hajime Matsui","submitted_at":"2012-09-29T06:18:34Z","abstract_excerpt":"An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity of error-value calculations in our algorithm improves that in solving systems of linear equations from error correcting pairs in many cases. A motivating example of our algorithm in case of a Reed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0083","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":"1210.0083","created_at":"2026-05-18T03:44:23.361054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0083v1","created_at":"2026-05-18T03:44:23.361054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0083","created_at":"2026-05-18T03:44:23.361054+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPGELVN2UCZI","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPGELVN2UCZIVWOT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPGELVN2","created_at":"2026-05-18T12:27:16.716162+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/NPGELVN2UCZIVWOTLI37OKG4AZ","json":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ.json","graph_json":"https://pith.science/api/pith-number/NPGELVN2UCZIVWOTLI37OKG4AZ/graph.json","events_json":"https://pith.science/api/pith-number/NPGELVN2UCZIVWOTLI37OKG4AZ/events.json","paper":"https://pith.science/paper/NPGELVN2"},"agent_actions":{"view_html":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ","download_json":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ.json","view_paper":"https://pith.science/paper/NPGELVN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0083&json=true","fetch_graph":"https://pith.science/api/pith-number/NPGELVN2UCZIVWOTLI37OKG4AZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NPGELVN2UCZIVWOTLI37OKG4AZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/action/storage_attestation","attest_author":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/action/author_attestation","sign_citation":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/action/citation_signature","submit_replication":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/action/replication_record"}},"created_at":"2026-05-18T03:44:23.361054+00:00","updated_at":"2026-05-18T03:44:23.361054+00:00"}