{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WT25Q6KQ274XMM3SPZVN72HSLB","short_pith_number":"pith:WT25Q6KQ","schema_version":"1.0","canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","source":{"kind":"arxiv","id":"1408.1310","version":1},"attestation_state":"computed","paper":{"title":"Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Ta Pai, Po-Ning Chen, Ting-Yi Wu, Yunghsiang S. Han","submitted_at":"2014-08-06T14:57:27Z","abstract_excerpt":"Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees finding the ML decision. Simulations on Reed-Muller codes show that the proposed two-phase sch"},"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":"1408.1310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-06T14:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e371d240b22de70095e33160ace11991a2e298782a5dd04518f167fc21219ce","abstract_canon_sha256":"1ac19e26be223afac9e4826882b39917c00c470132fcc2b21819ec69009274d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:47.557910Z","signature_b64":"59ZoHo6madfuESlLE+SOJatvR+xHVtFwZNw79GjmYxYiXJN/q2vRa2TqbyQ8YPVqe6/hAd7L6ZkDCCpCYQT7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f5d87950d7f97633727e6adfe8f25876a55a8e8c7401efc2f171b046a6d656","last_reissued_at":"2026-05-18T02:45:47.557276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:47.557276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Ta Pai, Po-Ning Chen, Ting-Yi Wu, Yunghsiang S. Han","submitted_at":"2014-08-06T14:57:27Z","abstract_excerpt":"Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees finding the ML decision. Simulations on Reed-Muller codes show that the proposed two-phase sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1310","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":"1408.1310","created_at":"2026-05-18T02:45:47.557393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1310v1","created_at":"2026-05-18T02:45:47.557393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1310","created_at":"2026-05-18T02:45:47.557393+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT25Q6KQ274X","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT25Q6KQ274XMM3S","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT25Q6KQ","created_at":"2026-05-18T12:28:54.890064+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/WT25Q6KQ274XMM3SPZVN72HSLB","json":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB.json","graph_json":"https://pith.science/api/pith-number/WT25Q6KQ274XMM3SPZVN72HSLB/graph.json","events_json":"https://pith.science/api/pith-number/WT25Q6KQ274XMM3SPZVN72HSLB/events.json","paper":"https://pith.science/paper/WT25Q6KQ"},"agent_actions":{"view_html":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB","download_json":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB.json","view_paper":"https://pith.science/paper/WT25Q6KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1310&json=true","fetch_graph":"https://pith.science/api/pith-number/WT25Q6KQ274XMM3SPZVN72HSLB/graph.json","fetch_events":"https://pith.science/api/pith-number/WT25Q6KQ274XMM3SPZVN72HSLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/action/storage_attestation","attest_author":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/action/author_attestation","sign_citation":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/action/citation_signature","submit_replication":"https://pith.science/pith/WT25Q6KQ274XMM3SPZVN72HSLB/action/replication_record"}},"created_at":"2026-05-18T02:45:47.557393+00:00","updated_at":"2026-05-18T02:45:47.557393+00:00"}