{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WAP7OTPDZXQB5I665BF45PRLDF","short_pith_number":"pith:WAP7OTPD","schema_version":"1.0","canonical_sha256":"b01ff74de3cde01ea3dee84bcebe2b196b17cda269d81d354d4896193004dbc0","source":{"kind":"arxiv","id":"1706.04709","version":2},"attestation_state":"computed","paper":{"title":"On the Maximum Size of Block Codes Subject to a Distance Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan, Yunghsiang S. Han","submitted_at":"2017-06-15T00:54:55Z","abstract_excerpt":"We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a codeword. We demonstrate that the number of such balls that cover the entire code alphabet cannot exceed this maximum size. Our approach can be applied to codes $i)$ with elements over arbitrary code alphabets, and $ii)$ under a broad class of distance measures, thereby ensuring the generality of our formula. Our formula indicates that the maximum code size"},"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":"1706.04709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-15T00:54:55Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"e7a299686290497de23587a84a66919f7779086114100a10989ac72331a64306","abstract_canon_sha256":"5a63dfdf096fbd638ae764d9c297ec74105d536156496f9026e9f001443ac892"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:01.833513Z","signature_b64":"ogjQ+3BnroNkd+uLgm7c/jBwT/ihV2cw0yzj1Bf5/mLi8pl5Rj5K0Gq3/y7crmZeu1js9rv2ZqWF2cxSCXP4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b01ff74de3cde01ea3dee84bcebe2b196b17cda269d81d354d4896193004dbc0","last_reissued_at":"2026-05-18T00:17:01.832767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:01.832767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Size of Block Codes Subject to a Distance Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan, Yunghsiang S. Han","submitted_at":"2017-06-15T00:54:55Z","abstract_excerpt":"We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a codeword. We demonstrate that the number of such balls that cover the entire code alphabet cannot exceed this maximum size. Our approach can be applied to codes $i)$ with elements over arbitrary code alphabets, and $ii)$ under a broad class of distance measures, thereby ensuring the generality of our formula. Our formula indicates that the maximum code size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04709","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":"1706.04709","created_at":"2026-05-18T00:17:01.832901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04709v2","created_at":"2026-05-18T00:17:01.832901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04709","created_at":"2026-05-18T00:17:01.832901+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAP7OTPDZXQB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAP7OTPDZXQB5I66","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAP7OTPD","created_at":"2026-05-18T12:31:53.515858+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/WAP7OTPDZXQB5I665BF45PRLDF","json":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF.json","graph_json":"https://pith.science/api/pith-number/WAP7OTPDZXQB5I665BF45PRLDF/graph.json","events_json":"https://pith.science/api/pith-number/WAP7OTPDZXQB5I665BF45PRLDF/events.json","paper":"https://pith.science/paper/WAP7OTPD"},"agent_actions":{"view_html":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF","download_json":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF.json","view_paper":"https://pith.science/paper/WAP7OTPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04709&json=true","fetch_graph":"https://pith.science/api/pith-number/WAP7OTPDZXQB5I665BF45PRLDF/graph.json","fetch_events":"https://pith.science/api/pith-number/WAP7OTPDZXQB5I665BF45PRLDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF/action/storage_attestation","attest_author":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF/action/author_attestation","sign_citation":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF/action/citation_signature","submit_replication":"https://pith.science/pith/WAP7OTPDZXQB5I665BF45PRLDF/action/replication_record"}},"created_at":"2026-05-18T00:17:01.832901+00:00","updated_at":"2026-05-18T00:17:01.832901+00:00"}