{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VSCGPQY5DK46GSGODENZCMW56L","short_pith_number":"pith:VSCGPQY5","schema_version":"1.0","canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","source":{"kind":"arxiv","id":"1705.07785","version":3},"attestation_state":"computed","paper":{"title":"An improvement of the asymptotic Elias bound for non-binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Kaipa","submitted_at":"2017-05-22T14:55:07Z","abstract_excerpt":"For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds.\n  The question of convexity of the asymptotic rate function is an important open question. We conjecture a much weaker form of the convexity, and we show that our bounds follow immediately if we assume the"},"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":"1705.07785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54f5e0bfb395456313ad54ac6371d68dc841c3bbd2b888556c19809d9a18b051","abstract_canon_sha256":"cfbc05df362f2381157e94a6230427e083578f1d24bcaaab8c4a99b1346f1d65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:29.237918Z","signature_b64":"dVoBsiX1Dc+QgRQxfss+KlQM2io/Plk6FvGk+dwM91zA0+BoG5k3qvMvfMQYlEepi7IoUDewLrpVpjo+E0GXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","last_reissued_at":"2026-05-18T00:22:29.237334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:29.237334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improvement of the asymptotic Elias bound for non-binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Kaipa","submitted_at":"2017-05-22T14:55:07Z","abstract_excerpt":"For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds.\n  The question of convexity of the asymptotic rate function is an important open question. We conjecture a much weaker form of the convexity, and we show that our bounds follow immediately if we assume the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07785","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":"1705.07785","created_at":"2026-05-18T00:22:29.237440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07785v3","created_at":"2026-05-18T00:22:29.237440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07785","created_at":"2026-05-18T00:22:29.237440+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSCGPQY5DK46","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSCGPQY5DK46GSGO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSCGPQY5","created_at":"2026-05-18T12:31:49.984773+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/VSCGPQY5DK46GSGODENZCMW56L","json":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L.json","graph_json":"https://pith.science/api/pith-number/VSCGPQY5DK46GSGODENZCMW56L/graph.json","events_json":"https://pith.science/api/pith-number/VSCGPQY5DK46GSGODENZCMW56L/events.json","paper":"https://pith.science/paper/VSCGPQY5"},"agent_actions":{"view_html":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L","download_json":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L.json","view_paper":"https://pith.science/paper/VSCGPQY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07785&json=true","fetch_graph":"https://pith.science/api/pith-number/VSCGPQY5DK46GSGODENZCMW56L/graph.json","fetch_events":"https://pith.science/api/pith-number/VSCGPQY5DK46GSGODENZCMW56L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/action/storage_attestation","attest_author":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/action/author_attestation","sign_citation":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/action/citation_signature","submit_replication":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/action/replication_record"}},"created_at":"2026-05-18T00:22:29.237440+00:00","updated_at":"2026-05-18T00:22:29.237440+00:00"}