{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KAMR43LDSWJDLLJWJP3JSIWDGR","short_pith_number":"pith:KAMR43LD","schema_version":"1.0","canonical_sha256":"50191e6d63959235ad364bf69922c3345c9e594f6ea9902491a967baa50ad889","source":{"kind":"arxiv","id":"1503.05761","version":3},"attestation_state":"computed","paper":{"title":"FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin, Tareq Y. Al-Naffouri, Yunghsiang S. Han","submitted_at":"2015-03-19T13:39:59Z","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"},"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":"1503.05761","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2015-03-19T13:39:59Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"fd4f745cf62c2d6b8b3eefa0f38bc9b87ddcf38113004c05d1dad3f34ab4105e","abstract_canon_sha256":"829b656ec3ea5a7893867c31b78ee10d3b50efa7092c191a5ff89d33053c3598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:07.110519Z","signature_b64":"fO4oopyytBkWTg5A79rrad+D7aDNECsuBXOaXHQt20W+DY/7MvDYWhUwQ7zu6xFVOtTNuYE5Jdvc8R8PdS3MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50191e6d63959235ad364bf69922c3345c9e594f6ea9902491a967baa50ad889","last_reissued_at":"2026-05-18T01:09:07.109965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:07.109965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin, Tareq Y. Al-Naffouri, Yunghsiang S. Han","submitted_at":"2015-03-19T13:39:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05761","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":"1503.05761","created_at":"2026-05-18T01:09:07.110037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05761v3","created_at":"2026-05-18T01:09:07.110037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05761","created_at":"2026-05-18T01:09:07.110037+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAMR43LDSWJD","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAMR43LDSWJDLLJW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAMR43LD","created_at":"2026-05-18T12:29:27.538025+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/KAMR43LDSWJDLLJWJP3JSIWDGR","json":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR.json","graph_json":"https://pith.science/api/pith-number/KAMR43LDSWJDLLJWJP3JSIWDGR/graph.json","events_json":"https://pith.science/api/pith-number/KAMR43LDSWJDLLJWJP3JSIWDGR/events.json","paper":"https://pith.science/paper/KAMR43LD"},"agent_actions":{"view_html":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR","download_json":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR.json","view_paper":"https://pith.science/paper/KAMR43LD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05761&json=true","fetch_graph":"https://pith.science/api/pith-number/KAMR43LDSWJDLLJWJP3JSIWDGR/graph.json","fetch_events":"https://pith.science/api/pith-number/KAMR43LDSWJDLLJWJP3JSIWDGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR/action/storage_attestation","attest_author":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR/action/author_attestation","sign_citation":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR/action/citation_signature","submit_replication":"https://pith.science/pith/KAMR43LDSWJDLLJWJP3JSIWDGR/action/replication_record"}},"created_at":"2026-05-18T01:09:07.110037+00:00","updated_at":"2026-05-18T01:09:07.110037+00:00"}