{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WIBQXBGYM3GSJV67NAUAZ4UEP3","short_pith_number":"pith:WIBQXBGY","schema_version":"1.0","canonical_sha256":"b2030b84d866cd24d7df68280cf2847ef799d92b33f51a04dcbf6fe055f7e56f","source":{"kind":"arxiv","id":"1707.04390","version":1},"attestation_state":"computed","paper":{"title":"Symbolic Stochastic Chase Decoding of Reed-Solomon and BCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Mani, Saied Hemati","submitted_at":"2017-07-14T05:37:02Z","abstract_excerpt":"This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for $q$-ary modulations and using soft information at the input of the decoder, the S-SCA is capable of outperforming conventional Symbolic-Chase algorithm (S-CA) with less computational cost. Since the S-SCA starts with the randomized generation of likely test-vectors, it reduces the complexity to polynomial order and also it does not need to find the least reliable symbols to generate test-vectors. Our simulation r"},"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":"1707.04390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-14T05:37:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a13dfb5fbe08eac88d9731f8dba2babb0bfb0c06a2cf9714dd2bd3bef690362","abstract_canon_sha256":"79e55c8a7601dcfe9a3b2fe35bb280b39789f609ad3671ce07172a92c90a7009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.361031Z","signature_b64":"mFxHilycVSl86J31Xd5qI5BoJmmwl6VBgxUgsPc0mYZGE8YSf651DHfkRM0wcEn/m5rxq4Vhq1ozbXtzlmX8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2030b84d866cd24d7df68280cf2847ef799d92b33f51a04dcbf6fe055f7e56f","last_reissued_at":"2026-05-18T00:40:18.360377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.360377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Stochastic Chase Decoding of Reed-Solomon and BCH Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Mani, Saied Hemati","submitted_at":"2017-07-14T05:37:02Z","abstract_excerpt":"This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for $q$-ary modulations and using soft information at the input of the decoder, the S-SCA is capable of outperforming conventional Symbolic-Chase algorithm (S-CA) with less computational cost. Since the S-SCA starts with the randomized generation of likely test-vectors, it reduces the complexity to polynomial order and also it does not need to find the least reliable symbols to generate test-vectors. Our simulation r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04390","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":"1707.04390","created_at":"2026-05-18T00:40:18.360480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04390v1","created_at":"2026-05-18T00:40:18.360480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04390","created_at":"2026-05-18T00:40:18.360480+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIBQXBGYM3GS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIBQXBGYM3GSJV67","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIBQXBGY","created_at":"2026-05-18T12:31:53.515858+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/WIBQXBGYM3GSJV67NAUAZ4UEP3","json":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3.json","graph_json":"https://pith.science/api/pith-number/WIBQXBGYM3GSJV67NAUAZ4UEP3/graph.json","events_json":"https://pith.science/api/pith-number/WIBQXBGYM3GSJV67NAUAZ4UEP3/events.json","paper":"https://pith.science/paper/WIBQXBGY"},"agent_actions":{"view_html":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3","download_json":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3.json","view_paper":"https://pith.science/paper/WIBQXBGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04390&json=true","fetch_graph":"https://pith.science/api/pith-number/WIBQXBGYM3GSJV67NAUAZ4UEP3/graph.json","fetch_events":"https://pith.science/api/pith-number/WIBQXBGYM3GSJV67NAUAZ4UEP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3/action/storage_attestation","attest_author":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3/action/author_attestation","sign_citation":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3/action/citation_signature","submit_replication":"https://pith.science/pith/WIBQXBGYM3GSJV67NAUAZ4UEP3/action/replication_record"}},"created_at":"2026-05-18T00:40:18.360480+00:00","updated_at":"2026-05-18T00:40:18.360480+00:00"}