{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HZI6AD4G2LQTJ426D4CK5UP3F6","short_pith_number":"pith:HZI6AD4G","schema_version":"1.0","canonical_sha256":"3e51e00f86d2e134f35e1f04aed1fb2f9b2fde1c9fbe8b28568dc48d645cabaf","source":{"kind":"arxiv","id":"1108.2893","version":1},"attestation_state":"computed","paper":{"title":"Reduced-Complexity Decoder of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xuebin Wu, Zhiyuan Yan","submitted_at":"2011-08-14T17:41:44Z","abstract_excerpt":"Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at multiple points, efficient DFT algorithms are promising in reducing the computational complexities of syndrome based decoders for long RS codes. In this paper, we first propose partial composite cyclotomic Fourier transforms (CCFTs) and then devise syndrome based decoders for long RS codes over la"},"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":"1108.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-14T17:41:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bc2500eb280dd0593e81ee579183ddba98cc05d92d892cf551d14818af6dd7d","abstract_canon_sha256":"d61bd58212c3466c58aa867d1645c3e37e53bf41b9ffe58364367487d16baa99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:54.106902Z","signature_b64":"IXOSYUnfa5el9mdfVlFV0l+KY/TDG+Z+Wrga/gnCHx5+gmtNH25ySTIv7UDe3i+yNhkMvMirwRk/ivItNwcVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e51e00f86d2e134f35e1f04aed1fb2f9b2fde1c9fbe8b28568dc48d645cabaf","last_reissued_at":"2026-05-18T02:00:54.105508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:54.105508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced-Complexity Decoder of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xuebin Wu, Zhiyuan Yan","submitted_at":"2011-08-14T17:41:44Z","abstract_excerpt":"Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at multiple points, efficient DFT algorithms are promising in reducing the computational complexities of syndrome based decoders for long RS codes. In this paper, we first propose partial composite cyclotomic Fourier transforms (CCFTs) and then devise syndrome based decoders for long RS codes over la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2893","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":"1108.2893","created_at":"2026-05-18T02:00:54.106170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2893v1","created_at":"2026-05-18T02:00:54.106170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2893","created_at":"2026-05-18T02:00:54.106170+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZI6AD4G2LQT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZI6AD4G2LQTJ426","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZI6AD4G","created_at":"2026-05-18T12:26:30.835961+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/HZI6AD4G2LQTJ426D4CK5UP3F6","json":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6.json","graph_json":"https://pith.science/api/pith-number/HZI6AD4G2LQTJ426D4CK5UP3F6/graph.json","events_json":"https://pith.science/api/pith-number/HZI6AD4G2LQTJ426D4CK5UP3F6/events.json","paper":"https://pith.science/paper/HZI6AD4G"},"agent_actions":{"view_html":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6","download_json":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6.json","view_paper":"https://pith.science/paper/HZI6AD4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2893&json=true","fetch_graph":"https://pith.science/api/pith-number/HZI6AD4G2LQTJ426D4CK5UP3F6/graph.json","fetch_events":"https://pith.science/api/pith-number/HZI6AD4G2LQTJ426D4CK5UP3F6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6/action/storage_attestation","attest_author":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6/action/author_attestation","sign_citation":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6/action/citation_signature","submit_replication":"https://pith.science/pith/HZI6AD4G2LQTJ426D4CK5UP3F6/action/replication_record"}},"created_at":"2026-05-18T02:00:54.106170+00:00","updated_at":"2026-05-18T02:00:54.106170+00:00"}