{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T5JZHBKCT5NN4LQRXXVGEKMFT6","short_pith_number":"pith:T5JZHBKC","schema_version":"1.0","canonical_sha256":"9f539385429f5ade2e11bdea6229859f906aa8513ee0bf09c1ea23faf93e7493","source":{"kind":"arxiv","id":"1508.01640","version":2},"attestation_state":"computed","paper":{"title":"Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeichi Hirasawa, Shunsuke Horii, Toshiyasu Matsushima","submitted_at":"2015-08-07T08:47:26Z","abstract_excerpt":"In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels. Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channels with high write resolution but low read resolution. The proposed decoding algorithm is based on a linear programming (LP). It is proved that the proposed LP decoder has the maximum-likelihood (ML) certificate property, i.e., the output of the decoder is guaranteed to be the ML codeword when it is integral. We also introduce the fractional pair distance $d_{fp}$ of a code which is a lower bound on "},"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":"1508.01640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-07T08:47:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27f843e27916ed39f4e98b33a905d3bcec0d72e766d49b7d7bdb9cff85a8f684","abstract_canon_sha256":"e5e013293349bcf0e900e59abd6254b6ec12b054109c0091e0aebb06237c4b4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:20.783755Z","signature_b64":"dSOneMfcuOB0h+R+M1AAthnMg8417zjVmj5/VCEZmUSKtr9Orh0zmFubKpAZ6pxAnKQ+XdPAM6q+zZvnb8DaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f539385429f5ade2e11bdea6229859f906aa8513ee0bf09c1ea23faf93e7493","last_reissued_at":"2026-05-18T00:54:20.783336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:20.783336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeichi Hirasawa, Shunsuke Horii, Toshiyasu Matsushima","submitted_at":"2015-08-07T08:47:26Z","abstract_excerpt":"In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels. Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channels with high write resolution but low read resolution. The proposed decoding algorithm is based on a linear programming (LP). It is proved that the proposed LP decoder has the maximum-likelihood (ML) certificate property, i.e., the output of the decoder is guaranteed to be the ML codeword when it is integral. We also introduce the fractional pair distance $d_{fp}$ of a code which is a lower bound on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01640","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":"1508.01640","created_at":"2026-05-18T00:54:20.783395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01640v2","created_at":"2026-05-18T00:54:20.783395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01640","created_at":"2026-05-18T00:54:20.783395+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5JZHBKCT5NN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5JZHBKCT5NN4LQR","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5JZHBKC","created_at":"2026-05-18T12:29:42.218222+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/T5JZHBKCT5NN4LQRXXVGEKMFT6","json":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6.json","graph_json":"https://pith.science/api/pith-number/T5JZHBKCT5NN4LQRXXVGEKMFT6/graph.json","events_json":"https://pith.science/api/pith-number/T5JZHBKCT5NN4LQRXXVGEKMFT6/events.json","paper":"https://pith.science/paper/T5JZHBKC"},"agent_actions":{"view_html":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6","download_json":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6.json","view_paper":"https://pith.science/paper/T5JZHBKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01640&json=true","fetch_graph":"https://pith.science/api/pith-number/T5JZHBKCT5NN4LQRXXVGEKMFT6/graph.json","fetch_events":"https://pith.science/api/pith-number/T5JZHBKCT5NN4LQRXXVGEKMFT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6/action/storage_attestation","attest_author":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6/action/author_attestation","sign_citation":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6/action/citation_signature","submit_replication":"https://pith.science/pith/T5JZHBKCT5NN4LQRXXVGEKMFT6/action/replication_record"}},"created_at":"2026-05-18T00:54:20.783395+00:00","updated_at":"2026-05-18T00:54:20.783395+00:00"}