{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LQARDP5VNNNSP6R7KUVGDQUS6J","short_pith_number":"pith:LQARDP5V","schema_version":"1.0","canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","source":{"kind":"arxiv","id":"1108.3754","version":2},"attestation_state":"computed","paper":{"title":"On Quasi-Cyclic Codes as a Generalization of Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christophe Chabot (LJK), Guillaume Quintin (INRIA Saclay - Ile de France, LIX), Morgan Barbier (INRIA Saclay - Ile de France","submitted_at":"2011-08-18T14:02:57Z","abstract_excerpt":"In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 der"},"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":"1108.3754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aa6ed0c7de0af1943bf38ff58c78bf6688ebbc6b82adb52c1a9623a85a2e02c","abstract_canon_sha256":"337912aa408d48ea33b59d8ecc41d47672bec2102d104bfff09b48fa1021bb01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:47.906498Z","signature_b64":"vvLumMoz5X65zNjMILY5y5lvz10+mZ/KX4LFNte2aII/cfWPqsCp/Vov402SJCgLdu5QeEPj0P4Hn3xyH2HEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","last_reissued_at":"2026-05-18T03:54:47.905658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:47.905658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quasi-Cyclic Codes as a Generalization of Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christophe Chabot (LJK), Guillaume Quintin (INRIA Saclay - Ile de France, LIX), Morgan Barbier (INRIA Saclay - Ile de France","submitted_at":"2011-08-18T14:02:57Z","abstract_excerpt":"In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 der"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3754","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":"1108.3754","created_at":"2026-05-18T03:54:47.905820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3754v2","created_at":"2026-05-18T03:54:47.905820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3754","created_at":"2026-05-18T03:54:47.905820+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQARDP5VNNNS","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQARDP5VNNNSP6R7","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQARDP5V","created_at":"2026-05-18T12:26:34.985390+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/LQARDP5VNNNSP6R7KUVGDQUS6J","json":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J.json","graph_json":"https://pith.science/api/pith-number/LQARDP5VNNNSP6R7KUVGDQUS6J/graph.json","events_json":"https://pith.science/api/pith-number/LQARDP5VNNNSP6R7KUVGDQUS6J/events.json","paper":"https://pith.science/paper/LQARDP5V"},"agent_actions":{"view_html":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J","download_json":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J.json","view_paper":"https://pith.science/paper/LQARDP5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3754&json=true","fetch_graph":"https://pith.science/api/pith-number/LQARDP5VNNNSP6R7KUVGDQUS6J/graph.json","fetch_events":"https://pith.science/api/pith-number/LQARDP5VNNNSP6R7KUVGDQUS6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/action/storage_attestation","attest_author":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/action/author_attestation","sign_citation":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/action/citation_signature","submit_replication":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/action/replication_record"}},"created_at":"2026-05-18T03:54:47.905820+00:00","updated_at":"2026-05-18T03:54:47.905820+00:00"}