{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TXS2YWQ7BZ6ZG5CDGX7PXP3GA5","short_pith_number":"pith:TXS2YWQ7","schema_version":"1.0","canonical_sha256":"9de5ac5a1f0e7d93744335fefbbf660772f47758f609bb43a13597a47b07ffc9","source":{"kind":"arxiv","id":"1612.00118","version":1},"attestation_state":"computed","paper":{"title":"Two-weight and three-weight codes from trace codes over $\\mathbb{F}_p+u\\mathbb{F}_p+v\\mathbb{F}_p+uv\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Patrick Sol\\'e, Yan Liu","submitted_at":"2016-12-01T02:47:07Z","abstract_excerpt":"We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\\mathbb{F}_p+u\\mathbb{F}_p+v\\mathbb{F}_p+uv\\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. With a linear Gray map, we obtain a class of abelian three-weight codes and two-weight codes over $\\mathbb{F}_p$. In particular, the two-weight codes we describe are shown to be optimal by application of the Griesmer bound. We also discuss their dual Lee dis"},"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.00118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-01T02:47:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7963026555ef668625cf0a4857cab7ad9ab25e5dd5c5860d9fd6a2bbd34f2ddc","abstract_canon_sha256":"501b8cf30718cf0bfd21cedb975146b674ee7c2a38f3393e96738563ca05e3e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:06.799850Z","signature_b64":"Ut20zEU3c1CMWgX3BLzVL442EzqNSotIrAa2VGtxrYFcZj/5IU+u+/4CSHTlvEOha/gx2orRsMOQgt76GQ6sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de5ac5a1f0e7d93744335fefbbf660772f47758f609bb43a13597a47b07ffc9","last_reissued_at":"2026-05-18T00:56:06.799259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:06.799259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-weight and three-weight codes from trace codes over $\\mathbb{F}_p+u\\mathbb{F}_p+v\\mathbb{F}_p+uv\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Patrick Sol\\'e, Yan Liu","submitted_at":"2016-12-01T02:47:07Z","abstract_excerpt":"We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\\mathbb{F}_p+u\\mathbb{F}_p+v\\mathbb{F}_p+uv\\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. With a linear Gray map, we obtain a class of abelian three-weight codes and two-weight codes over $\\mathbb{F}_p$. In particular, the two-weight codes we describe are shown to be optimal by application of the Griesmer bound. We also discuss their dual Lee dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00118","kind":"arxiv","version":1},"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.00118","created_at":"2026-05-18T00:56:06.799377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00118v1","created_at":"2026-05-18T00:56:06.799377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00118","created_at":"2026-05-18T00:56:06.799377+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXS2YWQ7BZ6Z","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXS2YWQ7BZ6ZG5CD","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXS2YWQ7","created_at":"2026-05-18T12:30:46.583412+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/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5","json":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5.json","graph_json":"https://pith.science/api/pith-number/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/graph.json","events_json":"https://pith.science/api/pith-number/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/events.json","paper":"https://pith.science/paper/TXS2YWQ7"},"agent_actions":{"view_html":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5","download_json":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5.json","view_paper":"https://pith.science/paper/TXS2YWQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00118&json=true","fetch_graph":"https://pith.science/api/pith-number/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/graph.json","fetch_events":"https://pith.science/api/pith-number/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/action/storage_attestation","attest_author":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/action/author_attestation","sign_citation":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/action/citation_signature","submit_replication":"https://pith.science/pith/TXS2YWQ7BZ6ZG5CDGX7PXP3GA5/action/replication_record"}},"created_at":"2026-05-18T00:56:06.799377+00:00","updated_at":"2026-05-18T00:56:06.799377+00:00"}