{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6BQXDPBYFOSWPCZWFXAYN2DMQS","short_pith_number":"pith:6BQXDPBY","schema_version":"1.0","canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","source":{"kind":"arxiv","id":"1511.02093","version":3},"attestation_state":"computed","paper":{"title":"Evaluation of the Hamming weights of a class of linear codes based on Gauss sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qin Yue, Ziling Heng","submitted_at":"2015-11-06T14:31:50Z","abstract_excerpt":"Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper c"},"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":"1511.02093","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T14:31:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"085f861e68fc7f2af8eee33479a6723b34e28a38cbb57e264ae1373290ee0273","abstract_canon_sha256":"ec40cba9465b61c7b8fc0cc1a4afbb2c96ce9aec58e78331ace5cfecb10c5194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:06.539356Z","signature_b64":"Hve+4vqMnGhBDtQ4kaxjyMXqWqQYhhf+AajhIqM+ATVOlvIAzvSbjWWrOmHCylL5FNqVS9gr7GDex6xSaSWHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06171bc382ba5678b362dc186e86c8497fc708bd6508047335a3be1cfaa5796","last_reissued_at":"2026-05-18T01:15:06.538634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:06.538634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluation of the Hamming weights of a class of linear codes based on Gauss sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qin Yue, Ziling Heng","submitted_at":"2015-11-06T14:31:50Z","abstract_excerpt":"Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02093","kind":"arxiv","version":3},"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":"1511.02093","created_at":"2026-05-18T01:15:06.538740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02093v3","created_at":"2026-05-18T01:15:06.538740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02093","created_at":"2026-05-18T01:15:06.538740+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BQXDPBYFOSW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BQXDPBYFOSWPCZW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BQXDPBY","created_at":"2026-05-18T12:29:07.941421+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/6BQXDPBYFOSWPCZWFXAYN2DMQS","json":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS.json","graph_json":"https://pith.science/api/pith-number/6BQXDPBYFOSWPCZWFXAYN2DMQS/graph.json","events_json":"https://pith.science/api/pith-number/6BQXDPBYFOSWPCZWFXAYN2DMQS/events.json","paper":"https://pith.science/paper/6BQXDPBY"},"agent_actions":{"view_html":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS","download_json":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS.json","view_paper":"https://pith.science/paper/6BQXDPBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02093&json=true","fetch_graph":"https://pith.science/api/pith-number/6BQXDPBYFOSWPCZWFXAYN2DMQS/graph.json","fetch_events":"https://pith.science/api/pith-number/6BQXDPBYFOSWPCZWFXAYN2DMQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/action/storage_attestation","attest_author":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/action/author_attestation","sign_citation":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/action/citation_signature","submit_replication":"https://pith.science/pith/6BQXDPBYFOSWPCZWFXAYN2DMQS/action/replication_record"}},"created_at":"2026-05-18T01:15:06.538740+00:00","updated_at":"2026-05-18T01:15:06.538740+00:00"}