{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FKYFQZLDANDEXQDP4XFPY7BCYZ","short_pith_number":"pith:FKYFQZLD","schema_version":"1.0","canonical_sha256":"2ab058656303464bc06fe5cafc7c22c66eb01464712e1eec98eceeff85135846","source":{"kind":"arxiv","id":"1102.2939","version":2},"attestation_state":"computed","paper":{"title":"On the Decoding Complexity of Cyclic Codes Up to the BCH Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Davide Schipani, Joachim Rosenthal, Michele Elia","submitted_at":"2011-02-15T01:07:25Z","abstract_excerpt":"The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the BCH bound $t$ is very efficient and practical for relatively small $n$ while it becomes unpractical for large $n$ as its computational complexity is $O(nt)$. Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from $O(nt)$ to $O(t\\sqrt n)$, and that of the error location from $O(nt)$ to at most $\\max \\{O(t\\sqrt n), O(t^2\\log(t)\\log(n))\\}$."},"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.2939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T01:07:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5bea6218e2b96d273cb1e1aa00555531d2627133a2b8e855bc2eb2b4da91e1ed","abstract_canon_sha256":"9ab0966e1bb3ccd608b0889adf0b604f9e38e4a63952e7897cc9010fec62a412"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.124745Z","signature_b64":"f2b1C5YlRWrlEf/wU9gSTsCDqVixHuXnkdiXSbAJBQVhBlNYHHC67FNXHWQJvBo++BBf/o0X/7V8YASyLWdIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ab058656303464bc06fe5cafc7c22c66eb01464712e1eec98eceeff85135846","last_reissued_at":"2026-05-18T00:58:19.124087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.124087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Decoding Complexity of Cyclic Codes Up to the BCH Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Davide Schipani, Joachim Rosenthal, Michele Elia","submitted_at":"2011-02-15T01:07:25Z","abstract_excerpt":"The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the BCH bound $t$ is very efficient and practical for relatively small $n$ while it becomes unpractical for large $n$ as its computational complexity is $O(nt)$. Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from $O(nt)$ to $O(t\\sqrt n)$, and that of the error location from $O(nt)$ to at most $\\max \\{O(t\\sqrt n), O(t^2\\log(t)\\log(n))\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2939","kind":"arxiv","version":2},"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.2939","created_at":"2026-05-18T00:58:19.124171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2939v2","created_at":"2026-05-18T00:58:19.124171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2939","created_at":"2026-05-18T00:58:19.124171+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKYFQZLDANDE","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKYFQZLDANDEXQDP","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKYFQZLD","created_at":"2026-05-18T12:26:28.662955+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/FKYFQZLDANDEXQDP4XFPY7BCYZ","json":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ.json","graph_json":"https://pith.science/api/pith-number/FKYFQZLDANDEXQDP4XFPY7BCYZ/graph.json","events_json":"https://pith.science/api/pith-number/FKYFQZLDANDEXQDP4XFPY7BCYZ/events.json","paper":"https://pith.science/paper/FKYFQZLD"},"agent_actions":{"view_html":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ","download_json":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ.json","view_paper":"https://pith.science/paper/FKYFQZLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2939&json=true","fetch_graph":"https://pith.science/api/pith-number/FKYFQZLDANDEXQDP4XFPY7BCYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FKYFQZLDANDEXQDP4XFPY7BCYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ/action/storage_attestation","attest_author":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ/action/author_attestation","sign_citation":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ/action/citation_signature","submit_replication":"https://pith.science/pith/FKYFQZLDANDEXQDP4XFPY7BCYZ/action/replication_record"}},"created_at":"2026-05-18T00:58:19.124171+00:00","updated_at":"2026-05-18T00:58:19.124171+00:00"}