{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z3WY2U7RPSUGVNGPMDCUC6263T","short_pith_number":"pith:Z3WY2U7R","schema_version":"1.0","canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","source":{"kind":"arxiv","id":"1102.1480","version":2},"attestation_state":"computed","paper":{"title":"Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byung-Hak Kim, Henry D. Pfister","submitted_at":"2011-02-08T00:21:38Z","abstract_excerpt":"This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of binary-input FSCs. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs in AWGN. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the join"},"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":"1102.1480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-08T00:21:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd0af6505aaaed042cf537284103bade7c6283933ec902080f47e3f983dc172a","abstract_canon_sha256":"53e25312a8cb25a30c155dfcb276ee36e4b87c479422d79dff93cdac0ea2c275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:15.630750Z","signature_b64":"10/1VzOzws77cduigiFhYBqkNBthVCCt6//j/FozS3jvqd+4IpV/XThzqmxQ/GPRvNEEE8Gtpr/jir+jxNSLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","last_reissued_at":"2026-05-18T02:03:15.630269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:15.630269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byung-Hak Kim, Henry D. Pfister","submitted_at":"2011-02-08T00:21:38Z","abstract_excerpt":"This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of binary-input FSCs. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs in AWGN. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the join"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1480","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":"1102.1480","created_at":"2026-05-18T02:03:15.630348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1480v2","created_at":"2026-05-18T02:03:15.630348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1480","created_at":"2026-05-18T02:03:15.630348+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3WY2U7RPSUG","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3WY2U7RPSUGVNGP","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3WY2U7R","created_at":"2026-05-18T12:26:47.523578+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/Z3WY2U7RPSUGVNGPMDCUC6263T","json":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T.json","graph_json":"https://pith.science/api/pith-number/Z3WY2U7RPSUGVNGPMDCUC6263T/graph.json","events_json":"https://pith.science/api/pith-number/Z3WY2U7RPSUGVNGPMDCUC6263T/events.json","paper":"https://pith.science/paper/Z3WY2U7R"},"agent_actions":{"view_html":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T","download_json":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T.json","view_paper":"https://pith.science/paper/Z3WY2U7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1480&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3WY2U7RPSUGVNGPMDCUC6263T/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3WY2U7RPSUGVNGPMDCUC6263T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/action/storage_attestation","attest_author":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/action/author_attestation","sign_citation":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/action/citation_signature","submit_replication":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/action/replication_record"}},"created_at":"2026-05-18T02:03:15.630348+00:00","updated_at":"2026-05-18T02:03:15.630348+00:00"}