{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KK4ITQDMZLB57RGTPXL3PTVGUK","short_pith_number":"pith:KK4ITQDM","schema_version":"1.0","canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","source":{"kind":"arxiv","id":"1105.1894","version":2},"attestation_state":"computed","paper":{"title":"Decoding Cyclic Codes up to a New Bound on the Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter, Sergey Bezzateev","submitted_at":"2011-05-10T09:51:05Z","abstract_excerpt":"A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula."},"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":"1105.1894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59a893f6a71f383cb4ded6b2681b2699661932b2ded2b59d8a7de6426f25584b","abstract_canon_sha256":"2cdd67ce5767778b37b9d77e322fbb067647036c85a467da67c2827ab63cdd4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:26.788255Z","signature_b64":"3NxEcnvucHA66JKMfHxC8spAOKiXezm7ECabzweL+2ygwa4blnxPgS5Dchgx5upUMXq5TBpn5pso3O8FrJw3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","last_reissued_at":"2026-05-18T04:00:26.787537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:26.787537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Cyclic Codes up to a New Bound on the Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter, Sergey Bezzateev","submitted_at":"2011-05-10T09:51:05Z","abstract_excerpt":"A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1894","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":"1105.1894","created_at":"2026-05-18T04:00:26.787635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1894v2","created_at":"2026-05-18T04:00:26.787635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1894","created_at":"2026-05-18T04:00:26.787635+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK4ITQDMZLB5","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK4ITQDMZLB57RGT","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK4ITQDM","created_at":"2026-05-18T12:26:32.869790+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/KK4ITQDMZLB57RGTPXL3PTVGUK","json":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK.json","graph_json":"https://pith.science/api/pith-number/KK4ITQDMZLB57RGTPXL3PTVGUK/graph.json","events_json":"https://pith.science/api/pith-number/KK4ITQDMZLB57RGTPXL3PTVGUK/events.json","paper":"https://pith.science/paper/KK4ITQDM"},"agent_actions":{"view_html":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK","download_json":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK.json","view_paper":"https://pith.science/paper/KK4ITQDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1894&json=true","fetch_graph":"https://pith.science/api/pith-number/KK4ITQDMZLB57RGTPXL3PTVGUK/graph.json","fetch_events":"https://pith.science/api/pith-number/KK4ITQDMZLB57RGTPXL3PTVGUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/action/storage_attestation","attest_author":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/action/author_attestation","sign_citation":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/action/citation_signature","submit_replication":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/action/replication_record"}},"created_at":"2026-05-18T04:00:26.787635+00:00","updated_at":"2026-05-18T04:00:26.787635+00:00"}