{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WR5BPUDHDDV6C4WGRFIHGO4AMI","short_pith_number":"pith:WR5BPUDH","schema_version":"1.0","canonical_sha256":"b47a17d06718ebe172c68950733b80620af66f39099cbcd2be261166e3efc706","source":{"kind":"arxiv","id":"2211.05513","version":2},"attestation_state":"computed","paper":{"title":"Coding Schemes Based on Reed-Muller Codes for $(d,\\infty)$-RLL Input-Constrained Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2022-11-10T12:14:51Z","abstract_excerpt":"The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s be separated by at least $d$ $0$s. In our study, we first consider $(d,\\infty)$-RLL subcodes of RM codes, taking the coordinates of the RM codes to be in the standard lexicographic ordering. We show, via a simple construction, that RM codes of rate $R$ have linear $(d,\\infty)$-RLL subcodes of rate $R\\cdot{2^{-\\left \\lceil \\log_2(d+1)\\right \\rceil}}"},"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":"2211.05513","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-11-10T12:14:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a375a62c2b635f2b24b846e60101ceb1c7671ded146c8e83cd1df223dd124965","abstract_canon_sha256":"626fa6c05edc5f8eb3fa4dbc6255e74a9fde1f60fc7e5a04251a6c36129a61ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:57.872827Z","signature_b64":"fkvA+lMmRO079BlXJLOL8G7wnfpdOefoWpM/58sT5AbrJAjxTy8y26J/27wEXCYh0brgmfr931dzM8O79A7ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b47a17d06718ebe172c68950733b80620af66f39099cbcd2be261166e3efc706","last_reissued_at":"2026-07-05T06:11:57.872410Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:57.872410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding Schemes Based on Reed-Muller Codes for $(d,\\infty)$-RLL Input-Constrained Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2022-11-10T12:14:51Z","abstract_excerpt":"The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s be separated by at least $d$ $0$s. In our study, we first consider $(d,\\infty)$-RLL subcodes of RM codes, taking the coordinates of the RM codes to be in the standard lexicographic ordering. We show, via a simple construction, that RM codes of rate $R$ have linear $(d,\\infty)$-RLL subcodes of rate $R\\cdot{2^{-\\left \\lceil \\log_2(d+1)\\right \\rceil}}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05513","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.05513/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.05513","created_at":"2026-07-05T06:11:57.872474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.05513v2","created_at":"2026-07-05T06:11:57.872474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05513","created_at":"2026-07-05T06:11:57.872474+00:00"},{"alias_kind":"pith_short_12","alias_value":"WR5BPUDHDDV6","created_at":"2026-07-05T06:11:57.872474+00:00"},{"alias_kind":"pith_short_16","alias_value":"WR5BPUDHDDV6C4WG","created_at":"2026-07-05T06:11:57.872474+00:00"},{"alias_kind":"pith_short_8","alias_value":"WR5BPUDH","created_at":"2026-07-05T06:11:57.872474+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/WR5BPUDHDDV6C4WGRFIHGO4AMI","json":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI.json","graph_json":"https://pith.science/api/pith-number/WR5BPUDHDDV6C4WGRFIHGO4AMI/graph.json","events_json":"https://pith.science/api/pith-number/WR5BPUDHDDV6C4WGRFIHGO4AMI/events.json","paper":"https://pith.science/paper/WR5BPUDH"},"agent_actions":{"view_html":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI","download_json":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI.json","view_paper":"https://pith.science/paper/WR5BPUDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.05513&json=true","fetch_graph":"https://pith.science/api/pith-number/WR5BPUDHDDV6C4WGRFIHGO4AMI/graph.json","fetch_events":"https://pith.science/api/pith-number/WR5BPUDHDDV6C4WGRFIHGO4AMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI/action/storage_attestation","attest_author":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI/action/author_attestation","sign_citation":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI/action/citation_signature","submit_replication":"https://pith.science/pith/WR5BPUDHDDV6C4WGRFIHGO4AMI/action/replication_record"}},"created_at":"2026-07-05T06:11:57.872474+00:00","updated_at":"2026-07-05T06:11:57.872474+00:00"}