{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KAMR43LDSWJDLLJWJP3JSIWDGR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"829b656ec3ea5a7893867c31b78ee10d3b50efa7092c191a5ff89d33053c3598","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-19T13:39:59Z","title_canon_sha256":"fd4f745cf62c2d6b8b3eefa0f38bc9b87ddcf38113004c05d1dad3f34ab4105e"},"schema_version":"1.0","source":{"id":"1503.05761","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05761","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05761v3","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05761","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"KAMR43LDSWJD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAMR43LDSWJDLLJW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAMR43LD","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:28d98ceade3e21ed493920b14bc5b98af60ca34ecf446111c3a2e00a2124b3b5","target":"graph","created_at":"2026-05-18T01:09:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\\mathcal{O}(n\\lg(n))$, where $n$ is the number of points evaluated in FFT. In this work, we reformulate this FFT algorithm such that it can be easier understood and be extended to develop frequency-domain decoding algorithms for $(n=2^m,k)$ systematic Reed-Solomon~(RS) codes over $\\mathbb{F}_{2^m},m\\in \\mathbb{Z}^+$, with $n-k$ a power of two. First, the basis of syndrome polynomials is reformulated in the decoding pr","authors_text":"Sian-Jheng Lin, Tareq Y. Al-Naffouri, Yunghsiang S. Han","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-19T13:39:59Z","title":"FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05761","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:42e048c90ed218b307af32cce7cfa211c1f367427d190db8441d64fb3d8762a1","target":"record","created_at":"2026-05-18T01:09:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"829b656ec3ea5a7893867c31b78ee10d3b50efa7092c191a5ff89d33053c3598","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-19T13:39:59Z","title_canon_sha256":"fd4f745cf62c2d6b8b3eefa0f38bc9b87ddcf38113004c05d1dad3f34ab4105e"},"schema_version":"1.0","source":{"id":"1503.05761","kind":"arxiv","version":3}},"canonical_sha256":"50191e6d63959235ad364bf69922c3345c9e594f6ea9902491a967baa50ad889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50191e6d63959235ad364bf69922c3345c9e594f6ea9902491a967baa50ad889","first_computed_at":"2026-05-18T01:09:07.109965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:07.109965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fO4oopyytBkWTg5A79rrad+D7aDNECsuBXOaXHQt20W+DY/7MvDYWhUwQ7zu6xFVOtTNuYE5Jdvc8R8PdS3MAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:07.110519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05761","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42e048c90ed218b307af32cce7cfa211c1f367427d190db8441d64fb3d8762a1","sha256:28d98ceade3e21ed493920b14bc5b98af60ca34ecf446111c3a2e00a2124b3b5"],"state_sha256":"e7f392a5cc31b84b44f0c203ada56ccffa43b6ea48c894ff762bc375c65a3dde"}