{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZYAWFZVS4WTK6EBAV54HA6VXTR","short_pith_number":"pith:ZYAWFZVS","schema_version":"1.0","canonical_sha256":"ce0162e6b2e5a6af1020af78707ab79c661a398bba12a47627fb2cd66405b94e","source":{"kind":"arxiv","id":"1501.07556","version":2},"attestation_state":"computed","paper":{"title":"Coding with Constraints: Minimum Distance Bounds and Systematic Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Matthew Thill, Wael Halbawi","submitted_at":"2015-01-29T19:36:09Z","abstract_excerpt":"We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes with good minimum distance that can be decoded efficiently. On this note, we provide theoretical bounds on the minimum distance of such a code based on the coded symbol constraints. We refine these bounds in the case where we demand a systematic linear code. Finally, we provide conditions under which each of these bounds can be achieved by choosing our code to "},"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":"1501.07556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T19:36:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b43b47ef1ac69730503db637cc590f7566f7da7dd5cb6fe412ae13f653fd14c9","abstract_canon_sha256":"8d63e30adc85b9c765762d7aef0225b9f8218f240c0b560e729defbfcafb83e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.101973Z","signature_b64":"IA81QY9rPbDGnXegJLMQrGTSjSuyoUSkFJVsZSEMv8K2alfEnvTzVy4GvRiRInie8c63q1fCBQ2g5+eFCWZyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0162e6b2e5a6af1020af78707ab79c661a398bba12a47627fb2cd66405b94e","last_reissued_at":"2026-05-18T02:26:45.101439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.101439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding with Constraints: Minimum Distance Bounds and Systematic Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Matthew Thill, Wael Halbawi","submitted_at":"2015-01-29T19:36:09Z","abstract_excerpt":"We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes with good minimum distance that can be decoded efficiently. On this note, we provide theoretical bounds on the minimum distance of such a code based on the coded symbol constraints. We refine these bounds in the case where we demand a systematic linear code. Finally, we provide conditions under which each of these bounds can be achieved by choosing our code to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07556","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":"1501.07556","created_at":"2026-05-18T02:26:45.101522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07556v2","created_at":"2026-05-18T02:26:45.101522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07556","created_at":"2026-05-18T02:26:45.101522+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYAWFZVS4WTK","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYAWFZVS4WTK6EBA","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYAWFZVS","created_at":"2026-05-18T12:29:52.810259+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/ZYAWFZVS4WTK6EBAV54HA6VXTR","json":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR.json","graph_json":"https://pith.science/api/pith-number/ZYAWFZVS4WTK6EBAV54HA6VXTR/graph.json","events_json":"https://pith.science/api/pith-number/ZYAWFZVS4WTK6EBAV54HA6VXTR/events.json","paper":"https://pith.science/paper/ZYAWFZVS"},"agent_actions":{"view_html":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR","download_json":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR.json","view_paper":"https://pith.science/paper/ZYAWFZVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07556&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYAWFZVS4WTK6EBAV54HA6VXTR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYAWFZVS4WTK6EBAV54HA6VXTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR/action/storage_attestation","attest_author":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR/action/author_attestation","sign_citation":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR/action/citation_signature","submit_replication":"https://pith.science/pith/ZYAWFZVS4WTK6EBAV54HA6VXTR/action/replication_record"}},"created_at":"2026-05-18T02:26:45.101522+00:00","updated_at":"2026-05-18T02:26:45.101522+00:00"}