{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HBPKSNMKFUA6W2ZACNVWWZS6SD","short_pith_number":"pith:HBPKSNMK","schema_version":"1.0","canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","source":{"kind":"arxiv","id":"1301.6231","version":2},"attestation_state":"computed","paper":{"title":"Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev","submitted_at":"2013-01-26T10:47:19Z","abstract_excerpt":"Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved.\n  Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them."},"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":"1301.6231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-26T10:47:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d51ae85469da439275009164c28320f8822267245b355f8b3ebdc3437a20b8c0","abstract_canon_sha256":"ee5b71d4e85f67d7d0c360960b9c691e183b27dd305a354fc5ea48af29632e70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:45.721648Z","signature_b64":"YX+sQ7pMDqLuZQXXzT73z7R+OPOk3sfJusQHLpKrclYAl6dtWKGHUrwjT5zhbWjndDV6OSur5TzJKX9tMC4JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"385ea9358a2d01eb6b20136b6b665e90f30128eb44deac42fa17b807e2815e2d","last_reissued_at":"2026-05-18T03:19:45.720837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:45.720837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev","submitted_at":"2013-01-26T10:47:19Z","abstract_excerpt":"Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved.\n  Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6231","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":"1301.6231","created_at":"2026-05-18T03:19:45.720949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6231v2","created_at":"2026-05-18T03:19:45.720949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6231","created_at":"2026-05-18T03:19:45.720949+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBPKSNMKFUA6","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBPKSNMKFUA6W2ZA","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBPKSNMK","created_at":"2026-05-18T12:27:46.883200+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/HBPKSNMKFUA6W2ZACNVWWZS6SD","json":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD.json","graph_json":"https://pith.science/api/pith-number/HBPKSNMKFUA6W2ZACNVWWZS6SD/graph.json","events_json":"https://pith.science/api/pith-number/HBPKSNMKFUA6W2ZACNVWWZS6SD/events.json","paper":"https://pith.science/paper/HBPKSNMK"},"agent_actions":{"view_html":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD","download_json":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD.json","view_paper":"https://pith.science/paper/HBPKSNMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6231&json=true","fetch_graph":"https://pith.science/api/pith-number/HBPKSNMKFUA6W2ZACNVWWZS6SD/graph.json","fetch_events":"https://pith.science/api/pith-number/HBPKSNMKFUA6W2ZACNVWWZS6SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/action/storage_attestation","attest_author":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/action/author_attestation","sign_citation":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/action/citation_signature","submit_replication":"https://pith.science/pith/HBPKSNMKFUA6W2ZACNVWWZS6SD/action/replication_record"}},"created_at":"2026-05-18T03:19:45.720949+00:00","updated_at":"2026-05-18T03:19:45.720949+00:00"}