{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N66FWWZ4P5EZRJJFMLVS2HE4CD","short_pith_number":"pith:N66FWWZ4","schema_version":"1.0","canonical_sha256":"6fbc5b5b3c7f4998a52562eb2d1c9c10d32e65435e1e8c89f5d96894b6deee95","source":{"kind":"arxiv","id":"1807.01246","version":2},"attestation_state":"computed","paper":{"title":"The Concatenated Structure of Quasi-Abelian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cem G\\\"uneri, Elif Sa\\c{c}{\\i}kara, Martino Borello, Patrick Sol\\'e","submitted_at":"2018-07-03T15:45:56Z","abstract_excerpt":"The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\\'e, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases."},"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":"1807.01246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-03T15:45:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d9c0f3f3531ad171e6917cf0cb780103b04c43a92d802e9029dc0e84948f6f4","abstract_canon_sha256":"2958eeaa13b29516dcdb38af63deb01321e509e11ade5184a632ca5d4541046e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:27.682814Z","signature_b64":"rfNwBrDUXMFsEYKvjRSsf4H8NJljyjAf/9uaY7RGgPW5XSgJ24kKRJZmxqvO087E/zWgDSWdFaeUClGraawBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbc5b5b3c7f4998a52562eb2d1c9c10d32e65435e1e8c89f5d96894b6deee95","last_reissued_at":"2026-05-17T23:50:27.682230Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:27.682230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Concatenated Structure of Quasi-Abelian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cem G\\\"uneri, Elif Sa\\c{c}{\\i}kara, Martino Borello, Patrick Sol\\'e","submitted_at":"2018-07-03T15:45:56Z","abstract_excerpt":"The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\\'e, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01246","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":"1807.01246","created_at":"2026-05-17T23:50:27.682303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01246v2","created_at":"2026-05-17T23:50:27.682303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01246","created_at":"2026-05-17T23:50:27.682303+00:00"},{"alias_kind":"pith_short_12","alias_value":"N66FWWZ4P5EZ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N66FWWZ4P5EZRJJF","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N66FWWZ4","created_at":"2026-05-18T12:32:40.477152+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/N66FWWZ4P5EZRJJFMLVS2HE4CD","json":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD.json","graph_json":"https://pith.science/api/pith-number/N66FWWZ4P5EZRJJFMLVS2HE4CD/graph.json","events_json":"https://pith.science/api/pith-number/N66FWWZ4P5EZRJJFMLVS2HE4CD/events.json","paper":"https://pith.science/paper/1807.01246"},"agent_actions":{"view_html":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD","download_json":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD.json","view_paper":"https://pith.science/paper/1807.01246","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01246&json=true","fetch_graph":"https://pith.science/api/pith-number/N66FWWZ4P5EZRJJFMLVS2HE4CD/graph.json","fetch_events":"https://pith.science/api/pith-number/N66FWWZ4P5EZRJJFMLVS2HE4CD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD/action/storage_attestation","attest_author":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD/action/author_attestation","sign_citation":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD/action/citation_signature","submit_replication":"https://pith.science/pith/N66FWWZ4P5EZRJJFMLVS2HE4CD/action/replication_record"}},"created_at":"2026-05-17T23:50:27.682303+00:00","updated_at":"2026-05-17T23:50:27.682303+00:00"}