{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4T55UOBKOTW3RC7JGTKJSJ46SV","short_pith_number":"pith:4T55UOBK","schema_version":"1.0","canonical_sha256":"e4fbda382a74edb88be934d499279e9545ffa2d72c8881799b60bac0618b75a5","source":{"kind":"arxiv","id":"1612.00123","version":2},"attestation_state":"computed","paper":{"title":"Optimal three-weight cubic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwei Zhu, Minjia Shi, Patrick Sol\\'e","submitted_at":"2016-12-01T03:08:31Z","abstract_excerpt":"In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\\mathbb{F}_2+v\\mathbb{F}_2+v^2\\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when $m$ is odd and $m>1$. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given."},"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":"1612.00123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T03:08:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4302cb1d1a9805890cf210a134098b6d6e29f2c22f1cd5525e05ba411c682354","abstract_canon_sha256":"8d82d951e3c719ff0919cd4d63c8589607f9f2ddfa976d2172bcaa4348651d26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:00.777366Z","signature_b64":"Y2EnYZj8wuFNWoi5ga7E1khTXsngiebMAfnRki4umoX6KaTMa396WG6xKeUX60fqz5j93Qj2wHmvcdDf0/mTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4fbda382a74edb88be934d499279e9545ffa2d72c8881799b60bac0618b75a5","last_reissued_at":"2026-05-18T00:12:00.776691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:00.776691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal three-weight cubic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwei Zhu, Minjia Shi, Patrick Sol\\'e","submitted_at":"2016-12-01T03:08:31Z","abstract_excerpt":"In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\\mathbb{F}_2+v\\mathbb{F}_2+v^2\\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when $m$ is odd and $m>1$. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00123","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":"1612.00123","created_at":"2026-05-18T00:12:00.776796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00123v2","created_at":"2026-05-18T00:12:00.776796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00123","created_at":"2026-05-18T00:12:00.776796+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T55UOBKOTW3","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T55UOBKOTW3RC7J","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T55UOBK","created_at":"2026-05-18T12:29:58.707656+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/4T55UOBKOTW3RC7JGTKJSJ46SV","json":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV.json","graph_json":"https://pith.science/api/pith-number/4T55UOBKOTW3RC7JGTKJSJ46SV/graph.json","events_json":"https://pith.science/api/pith-number/4T55UOBKOTW3RC7JGTKJSJ46SV/events.json","paper":"https://pith.science/paper/4T55UOBK"},"agent_actions":{"view_html":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV","download_json":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV.json","view_paper":"https://pith.science/paper/4T55UOBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00123&json=true","fetch_graph":"https://pith.science/api/pith-number/4T55UOBKOTW3RC7JGTKJSJ46SV/graph.json","fetch_events":"https://pith.science/api/pith-number/4T55UOBKOTW3RC7JGTKJSJ46SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV/action/storage_attestation","attest_author":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV/action/author_attestation","sign_citation":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV/action/citation_signature","submit_replication":"https://pith.science/pith/4T55UOBKOTW3RC7JGTKJSJ46SV/action/replication_record"}},"created_at":"2026-05-18T00:12:00.776796+00:00","updated_at":"2026-05-18T00:12:00.776796+00:00"}