{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FM6RGWDIZZYILILM5G7AXLXPWV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a818b5feb60f93adcbf60d1bcc5f6be24408aa272e4c54f29de4aa7f9fbb0edb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T02:05:48Z","title_canon_sha256":"0a129562231d8646f23c0bcc173acdff006fda83fff9977fb4e39ac72d0bd644"},"schema_version":"1.0","source":{"id":"1705.06847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06847","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06847v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06847","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"FM6RGWDIZZYI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FM6RGWDIZZYILILM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FM6RGWDI","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:726c67c4d77dbd16535599614a7d39e700c11dd5de7fdd6eda301a2d46a156bb","target":"graph","created_at":"2026-05-18T00:44:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs, thus proving the existence of good rate-compatible codes. Then, we propose a general framework for constructing rate-compatible ECCs based on cosets and syndromes of a set of nested linear codes. We evaluate our construction from two points of view. From a combinatorial perspective, we show that we can construct rate-compatible codes with increasing minimum dis","authors_text":"Erich F. Haratsch, Paul H. Siegel, Pengfei Huang, Xiaojie Zhang, Yi Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T02:05:48Z","title":"Syndrome-Coupled Rate-Compatible Error-Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06847","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e80431bf21bb39faf675e107d13a78b0fd835ea8769b9d77f09498f1e2393ab","target":"record","created_at":"2026-05-18T00:44:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a818b5feb60f93adcbf60d1bcc5f6be24408aa272e4c54f29de4aa7f9fbb0edb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T02:05:48Z","title_canon_sha256":"0a129562231d8646f23c0bcc173acdff006fda83fff9977fb4e39ac72d0bd644"},"schema_version":"1.0","source":{"id":"1705.06847","kind":"arxiv","version":1}},"canonical_sha256":"2b3d135868ce7085a16ce9be0baeefb54c4195602964c2615fff68f5ec0fb065","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b3d135868ce7085a16ce9be0baeefb54c4195602964c2615fff68f5ec0fb065","first_computed_at":"2026-05-18T00:44:11.162854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.162854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SquEHJoZWXwsTPH2ifoVPHMvrnBqlazd4Nj545ZDRZGN+J1Uq/SDD60wsqp6iAPzHH4NMtgvmz0kAef2nlq0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.163362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e80431bf21bb39faf675e107d13a78b0fd835ea8769b9d77f09498f1e2393ab","sha256:726c67c4d77dbd16535599614a7d39e700c11dd5de7fdd6eda301a2d46a156bb"],"state_sha256":"4113a0250eec590b9aa9c11f75bd457f466337da58c10bf90d20da095640ae0a"}