{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O4GCSXOD32XVYV6B27XWNM5ECZ","short_pith_number":"pith:O4GCSXOD","schema_version":"1.0","canonical_sha256":"770c295dc3deaf5c57c1d7ef66b3a41672b167ff077a7f3fcc81b2474adbbbb4","source":{"kind":"arxiv","id":"1809.03764","version":1},"attestation_state":"computed","paper":{"title":"A note on reducing the computation time for minimum distance and equivalence check of binary linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krassimir Enev, Nikolay Yankov","submitted_at":"2018-09-11T09:32:57Z","abstract_excerpt":"In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have also considered the usefulness of combinatorial $2$-$(t,k,1)$ designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence."},"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":"1809.03764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-11T09:32:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ed9f5232dd32cb5d422f9bbc2e5ff42f2e4e85b2df3e9b5cf2150c951a25188","abstract_canon_sha256":"40f98f4433082bc41b845ca472318f71ccabfdd48051bab5e1abc44a77145b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:59.888443Z","signature_b64":"QBU1m2/I090u76jWrsfBYAwub/kAzNoIE6JPkq4y9Q7oUWLsx3gaSL1m5yBsBtfe7/ZC3cQ7W3ZSE+0sjTGrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770c295dc3deaf5c57c1d7ef66b3a41672b167ff077a7f3fcc81b2474adbbbb4","last_reissued_at":"2026-05-18T00:05:59.887896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:59.887896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on reducing the computation time for minimum distance and equivalence check of binary linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krassimir Enev, Nikolay Yankov","submitted_at":"2018-09-11T09:32:57Z","abstract_excerpt":"In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have also considered the usefulness of combinatorial $2$-$(t,k,1)$ designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03764","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":"1809.03764","created_at":"2026-05-18T00:05:59.887977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03764v1","created_at":"2026-05-18T00:05:59.887977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03764","created_at":"2026-05-18T00:05:59.887977+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4GCSXOD32XV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4GCSXOD32XVYV6B","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4GCSXOD","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/O4GCSXOD32XVYV6B27XWNM5ECZ","json":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ.json","graph_json":"https://pith.science/api/pith-number/O4GCSXOD32XVYV6B27XWNM5ECZ/graph.json","events_json":"https://pith.science/api/pith-number/O4GCSXOD32XVYV6B27XWNM5ECZ/events.json","paper":"https://pith.science/paper/O4GCSXOD"},"agent_actions":{"view_html":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ","download_json":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ.json","view_paper":"https://pith.science/paper/O4GCSXOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03764&json=true","fetch_graph":"https://pith.science/api/pith-number/O4GCSXOD32XVYV6B27XWNM5ECZ/graph.json","fetch_events":"https://pith.science/api/pith-number/O4GCSXOD32XVYV6B27XWNM5ECZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ/action/storage_attestation","attest_author":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ/action/author_attestation","sign_citation":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ/action/citation_signature","submit_replication":"https://pith.science/pith/O4GCSXOD32XVYV6B27XWNM5ECZ/action/replication_record"}},"created_at":"2026-05-18T00:05:59.887977+00:00","updated_at":"2026-05-18T00:05:59.887977+00:00"}