{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RJFOSDLVZBRVCQ56CRMTGM7KPE","short_pith_number":"pith:RJFOSDLV","schema_version":"1.0","canonical_sha256":"8a4ae90d75c8635143be14593333ea7912498049a17f5bc4db18d2799eeacbb7","source":{"kind":"arxiv","id":"1707.06628","version":2},"attestation_state":"computed","paper":{"title":"On the covering radius of small codes versus dual distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Louay Bazzi","submitted_at":"2017-07-20T17:38:58Z","abstract_excerpt":"Tiet\\\"{a}v\\\"{a}inen's upper and lower bounds assert that for block-length-$n$ linear codes with dual distance $d$, the covering radius $R$ is at most $\\frac{n}{2}-(\\frac{1}{2}-o(1))\\sqrt{dn}$ and typically at least $\\frac{n}{2}-\\Theta(\\sqrt{dn\\log{\\frac{n}{d}}})$. The gap between those bounds on $R -\\frac{n}{2}$ is an $\\Theta(\\sqrt{\\log{\\frac{n}{d}}})$ factor related to the gap between the worst covering radius given $d$ and the sphere-covering bound. Our focus in this paper is on the case when $d = o(n)$, i.e., when the code size is subexponential and the gap is $w(1)$. We show that up to a 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":"1707.06628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T17:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e04bfb7c0c137121c805d934b01cc3d64bda5de300350d2741ca9f3bfacf27e0","abstract_canon_sha256":"45fcf27357bc19900de401303b7dc62ba335aed53740a411b6b47a6471d0a0f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.038992Z","signature_b64":"P1mHTSQQES9ri30vrUZFIoAXQnlFRoWeifmN9er7FlH+tgmMgGy8j2yd0vFK7ymEXmA8Cw81aPAwZ1ZGLTXDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a4ae90d75c8635143be14593333ea7912498049a17f5bc4db18d2799eeacbb7","last_reissued_at":"2026-05-18T00:09:53.038346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.038346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the covering radius of small codes versus dual distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Louay Bazzi","submitted_at":"2017-07-20T17:38:58Z","abstract_excerpt":"Tiet\\\"{a}v\\\"{a}inen's upper and lower bounds assert that for block-length-$n$ linear codes with dual distance $d$, the covering radius $R$ is at most $\\frac{n}{2}-(\\frac{1}{2}-o(1))\\sqrt{dn}$ and typically at least $\\frac{n}{2}-\\Theta(\\sqrt{dn\\log{\\frac{n}{d}}})$. The gap between those bounds on $R -\\frac{n}{2}$ is an $\\Theta(\\sqrt{\\log{\\frac{n}{d}}})$ factor related to the gap between the worst covering radius given $d$ and the sphere-covering bound. Our focus in this paper is on the case when $d = o(n)$, i.e., when the code size is subexponential and the gap is $w(1)$. We show that up to a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06628","kind":"arxiv","version":2},"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":"1707.06628","created_at":"2026-05-18T00:09:53.038444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06628v2","created_at":"2026-05-18T00:09:53.038444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06628","created_at":"2026-05-18T00:09:53.038444+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJFOSDLVZBRV","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJFOSDLVZBRVCQ56","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJFOSDLV","created_at":"2026-05-18T12:31:39.905425+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/RJFOSDLVZBRVCQ56CRMTGM7KPE","json":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE.json","graph_json":"https://pith.science/api/pith-number/RJFOSDLVZBRVCQ56CRMTGM7KPE/graph.json","events_json":"https://pith.science/api/pith-number/RJFOSDLVZBRVCQ56CRMTGM7KPE/events.json","paper":"https://pith.science/paper/RJFOSDLV"},"agent_actions":{"view_html":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE","download_json":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE.json","view_paper":"https://pith.science/paper/RJFOSDLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06628&json=true","fetch_graph":"https://pith.science/api/pith-number/RJFOSDLVZBRVCQ56CRMTGM7KPE/graph.json","fetch_events":"https://pith.science/api/pith-number/RJFOSDLVZBRVCQ56CRMTGM7KPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE/action/storage_attestation","attest_author":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE/action/author_attestation","sign_citation":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE/action/citation_signature","submit_replication":"https://pith.science/pith/RJFOSDLVZBRVCQ56CRMTGM7KPE/action/replication_record"}},"created_at":"2026-05-18T00:09:53.038444+00:00","updated_at":"2026-05-18T00:09:53.038444+00:00"}