{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FKYFQZLDANDEXQDP4XFPY7BCYZ","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":"9ab0966e1bb3ccd608b0889adf0b604f9e38e4a63952e7897cc9010fec62a412","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T01:07:25Z","title_canon_sha256":"5bea6218e2b96d273cb1e1aa00555531d2627133a2b8e855bc2eb2b4da91e1ed"},"schema_version":"1.0","source":{"id":"1102.2939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2939","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2939v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2939","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"FKYFQZLDANDE","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FKYFQZLDANDEXQDP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FKYFQZLD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:064abb28d93cfa0efaf0f8ce21c79d99ec61bd7391c4212b802b417514055a48","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"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))\\}$.","authors_text":"Davide Schipani, Joachim Rosenthal, Michele Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T01:07:25Z","title":"On the Decoding Complexity of Cyclic Codes Up to the BCH Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2939","kind":"arxiv","version":2},"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:97f439c0b7f8821324a797f8d0b9018170c99c338098d3a4518a1a498526dbb1","target":"record","created_at":"2026-05-18T00:58:19Z","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":"9ab0966e1bb3ccd608b0889adf0b604f9e38e4a63952e7897cc9010fec62a412","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T01:07:25Z","title_canon_sha256":"5bea6218e2b96d273cb1e1aa00555531d2627133a2b8e855bc2eb2b4da91e1ed"},"schema_version":"1.0","source":{"id":"1102.2939","kind":"arxiv","version":2}},"canonical_sha256":"2ab058656303464bc06fe5cafc7c22c66eb01464712e1eec98eceeff85135846","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ab058656303464bc06fe5cafc7c22c66eb01464712e1eec98eceeff85135846","first_computed_at":"2026-05-18T00:58:19.124087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.124087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f2b1C5YlRWrlEf/wU9gSTsCDqVixHuXnkdiXSbAJBQVhBlNYHHC67FNXHWQJvBo++BBf/o0X/7V8YASyLWdIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.124745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97f439c0b7f8821324a797f8d0b9018170c99c338098d3a4518a1a498526dbb1","sha256:064abb28d93cfa0efaf0f8ce21c79d99ec61bd7391c4212b802b417514055a48"],"state_sha256":"2c3846abc42d6d414f19f04b24f7825273964c9bb96946f6bec82cb03c3b99c8"}