{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5GKG7KGP74JRRV2YUIYLJ5GEGI","short_pith_number":"pith:5GKG7KGP","schema_version":"1.0","canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","source":{"kind":"arxiv","id":"1506.01955","version":1},"attestation_state":"computed","paper":{"title":"The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket Ozkaya, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Steven T. Dougherty","submitted_at":"2015-06-05T16:07:00Z","abstract_excerpt":"Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters."},"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":"1506.01955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:07:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5587c5f9e61e67dc558a96058450c54e865ac3db66205524738fbcd6feb688c","abstract_canon_sha256":"eee77e861e3e6d01d57751d186a427a30057e39c64bcd2c7ccd52d9f24937282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:58.821801Z","signature_b64":"jd8rtz/OwnS9fAPK2dcAK0EwdwjzryaN93fw2m18GO9ap/KAZzyYIffErP8OpzpiFOdX9zEhUpFvUQs4uyI3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9946fa8cfff1318d758a230b4f4c4322a85070276ccf7d2896f1b4e026c0dfa","last_reissued_at":"2026-05-18T01:55:58.821025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:58.821025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket Ozkaya, Jon-Lark Kim, Lin Sok, Patrick Sol\\'e, Steven T. Dougherty","submitted_at":"2015-06-05T16:07:00Z","abstract_excerpt":"Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01955","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":"1506.01955","created_at":"2026-05-18T01:55:58.821144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01955v1","created_at":"2026-05-18T01:55:58.821144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01955","created_at":"2026-05-18T01:55:58.821144+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GKG7KGP74JR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GKG7KGP74JRRV2Y","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GKG7KGP","created_at":"2026-05-18T12:29:05.191682+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/5GKG7KGP74JRRV2YUIYLJ5GEGI","json":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI.json","graph_json":"https://pith.science/api/pith-number/5GKG7KGP74JRRV2YUIYLJ5GEGI/graph.json","events_json":"https://pith.science/api/pith-number/5GKG7KGP74JRRV2YUIYLJ5GEGI/events.json","paper":"https://pith.science/paper/5GKG7KGP"},"agent_actions":{"view_html":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI","download_json":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI.json","view_paper":"https://pith.science/paper/5GKG7KGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01955&json=true","fetch_graph":"https://pith.science/api/pith-number/5GKG7KGP74JRRV2YUIYLJ5GEGI/graph.json","fetch_events":"https://pith.science/api/pith-number/5GKG7KGP74JRRV2YUIYLJ5GEGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/action/storage_attestation","attest_author":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/action/author_attestation","sign_citation":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/action/citation_signature","submit_replication":"https://pith.science/pith/5GKG7KGP74JRRV2YUIYLJ5GEGI/action/replication_record"}},"created_at":"2026-05-18T01:55:58.821144+00:00","updated_at":"2026-05-18T01:55:58.821144+00:00"}