{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FKDACGOKWIEUYWCKMEF5KLG625","short_pith_number":"pith:FKDACGOK","schema_version":"1.0","canonical_sha256":"2a860119cab2094c584a610bd52cded75fd4568aa1b3f119f8f3082733876add","source":{"kind":"arxiv","id":"2007.16029","version":2},"attestation_state":"computed","paper":{"title":"Quasi-Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uneri, San Ling","submitted_at":"2020-07-30T04:46:05Z","abstract_excerpt":"Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some asymptotic results, a few minimum distance bounds and further applications such as the trace representation and characterization of certain subfamilies of quasi-cyclic codes are elaborated. This survey will appear as a chapter in \"A Concise Encyclopedia of Coding Theory\" to be published by CRC Press."},"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":"2007.16029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-30T04:46:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9817e4f469dd22b7a414cedb2fa4118312c6668327712a41c4ceb91e32751eff","abstract_canon_sha256":"af4afcd8f8e716e2fbc46ce016d0adbb3b6fdc3713e6ac0a099ddda46d28b5d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:11.123606Z","signature_b64":"Gw8FYgilRz3VxKYTfIe+wH1Iv4X/916/DsvvXfFPwxqsFqma6nvcRtq0lzPyIbQJyB0utgEcQydXjptdpnT7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a860119cab2094c584a610bd52cded75fd4568aa1b3f119f8f3082733876add","last_reissued_at":"2026-07-05T01:58:11.123134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:11.123134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uneri, San Ling","submitted_at":"2020-07-30T04:46:05Z","abstract_excerpt":"Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some asymptotic results, a few minimum distance bounds and further applications such as the trace representation and characterization of certain subfamilies of quasi-cyclic codes are elaborated. This survey will appear as a chapter in \"A Concise Encyclopedia of Coding Theory\" to be published by CRC Press."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.16029","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.16029/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.16029","created_at":"2026-07-05T01:58:11.123197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.16029v2","created_at":"2026-07-05T01:58:11.123197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.16029","created_at":"2026-07-05T01:58:11.123197+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKDACGOKWIEU","created_at":"2026-07-05T01:58:11.123197+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKDACGOKWIEUYWCK","created_at":"2026-07-05T01:58:11.123197+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKDACGOK","created_at":"2026-07-05T01:58:11.123197+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/FKDACGOKWIEUYWCKMEF5KLG625","json":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625.json","graph_json":"https://pith.science/api/pith-number/FKDACGOKWIEUYWCKMEF5KLG625/graph.json","events_json":"https://pith.science/api/pith-number/FKDACGOKWIEUYWCKMEF5KLG625/events.json","paper":"https://pith.science/paper/FKDACGOK"},"agent_actions":{"view_html":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625","download_json":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625.json","view_paper":"https://pith.science/paper/FKDACGOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.16029&json=true","fetch_graph":"https://pith.science/api/pith-number/FKDACGOKWIEUYWCKMEF5KLG625/graph.json","fetch_events":"https://pith.science/api/pith-number/FKDACGOKWIEUYWCKMEF5KLG625/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625/action/storage_attestation","attest_author":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625/action/author_attestation","sign_citation":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625/action/citation_signature","submit_replication":"https://pith.science/pith/FKDACGOKWIEUYWCKMEF5KLG625/action/replication_record"}},"created_at":"2026-07-05T01:58:11.123197+00:00","updated_at":"2026-07-05T01:58:11.123197+00:00"}