{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:F5NVFWFZ3BXB2MPZWOE2C46C4J","short_pith_number":"pith:F5NVFWFZ","schema_version":"1.0","canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","source":{"kind":"arxiv","id":"cs/0411006","version":1},"attestation_state":"computed","paper":{"title":"Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Steven W. McLaughlin, Yogesh Sankarasubramaniam","submitted_at":"2004-11-03T19:20:11Z","abstract_excerpt":"In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving, and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf [2]. This method uses fewer than k-d biased bit streams to achieve"},"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":"cs/0411006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f31260efe1100a13e3f6d2f7c058259ffd47d7396164a1a1317d6b03596ec10","abstract_canon_sha256":"f8d19bd303cf82021c10a9d7b75d6f19a244874f46442790bf744c169f0967e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.184025Z","signature_b64":"7Y4kYbVBnzJFLkhNyWjNNq1lxjPB4Lzy+yVra0WajvNZAn8ZS72DEeMVb2fmOQpD9SkdMuDngT06F/VOQpH9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","last_reissued_at":"2026-05-18T00:57:45.183521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.183521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Steven W. McLaughlin, Yogesh Sankarasubramaniam","submitted_at":"2004-11-03T19:20:11Z","abstract_excerpt":"In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving, and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf [2]. This method uses fewer than k-d biased bit streams to achieve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0411006","kind":"arxiv","version":1},"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":"cs/0411006","created_at":"2026-05-18T00:57:45.183600+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0411006v1","created_at":"2026-05-18T00:57:45.183600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411006","created_at":"2026-05-18T00:57:45.183600+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5NVFWFZ3BXB","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5NVFWFZ3BXB2MPZ","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5NVFWFZ","created_at":"2026-05-18T12:25:52.687210+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/F5NVFWFZ3BXB2MPZWOE2C46C4J","json":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J.json","graph_json":"https://pith.science/api/pith-number/F5NVFWFZ3BXB2MPZWOE2C46C4J/graph.json","events_json":"https://pith.science/api/pith-number/F5NVFWFZ3BXB2MPZWOE2C46C4J/events.json","paper":"https://pith.science/paper/F5NVFWFZ"},"agent_actions":{"view_html":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J","download_json":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J.json","view_paper":"https://pith.science/paper/F5NVFWFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0411006&json=true","fetch_graph":"https://pith.science/api/pith-number/F5NVFWFZ3BXB2MPZWOE2C46C4J/graph.json","fetch_events":"https://pith.science/api/pith-number/F5NVFWFZ3BXB2MPZWOE2C46C4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/action/storage_attestation","attest_author":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/action/author_attestation","sign_citation":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/action/citation_signature","submit_replication":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/action/replication_record"}},"created_at":"2026-05-18T00:57:45.183600+00:00","updated_at":"2026-05-18T00:57:45.183600+00:00"}