{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XCNYB6DAVFGVXGY43L35GZ55VJ","short_pith_number":"pith:XCNYB6DA","schema_version":"1.0","canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","source":{"kind":"arxiv","id":"1501.05927","version":2},"attestation_state":"computed","paper":{"title":"Multiple-Symbol Interleaved RS Codes and Two-Pass Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chini, J. Zhou, M. Kilani, Z. Wang","submitted_at":"2015-01-23T19:49:16Z","abstract_excerpt":"For communication systems with heavy burst noise, an optimal Forward Error Correction (FEC) scheme is expected to have a large burst error correction capacity while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved coding scheme can achieve nearly twice as much as the burst error correction capability of conventional symbol-interleaved Reed-Solomon codes with the same code length and "},"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":"1501.05927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-23T19:49:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88c00742f419bd2481241af5d89cb7592e4ebb76a1bcbf031e4cbeb9f5f45be6","abstract_canon_sha256":"37bb0ad2acdbc0c7eae91de6bfd17ed4ac46c9c95465e065d6910d323f31cebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.193434Z","signature_b64":"VnwlZNAfozX1lWNru26HoNOb3df/9BH5AkSKruglReGfDtJvjVM04tPwdHkdp906uap8CW0Togw5Z3U2egFbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89b80f860a94d5b9b1cdaf7d367bdaa5946d15fd239ce9301a5f60c248d4e2e","last_reissued_at":"2026-05-18T02:28:47.193042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.193042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Symbol Interleaved RS Codes and Two-Pass Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chini, J. Zhou, M. Kilani, Z. Wang","submitted_at":"2015-01-23T19:49:16Z","abstract_excerpt":"For communication systems with heavy burst noise, an optimal Forward Error Correction (FEC) scheme is expected to have a large burst error correction capacity while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved coding scheme can achieve nearly twice as much as the burst error correction capability of conventional symbol-interleaved Reed-Solomon codes with the same code length and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05927","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":"1501.05927","created_at":"2026-05-18T02:28:47.193107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05927v2","created_at":"2026-05-18T02:28:47.193107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05927","created_at":"2026-05-18T02:28:47.193107+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCNYB6DAVFGV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCNYB6DAVFGVXGY4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCNYB6DA","created_at":"2026-05-18T12:29:50.041715+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/XCNYB6DAVFGVXGY43L35GZ55VJ","json":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ.json","graph_json":"https://pith.science/api/pith-number/XCNYB6DAVFGVXGY43L35GZ55VJ/graph.json","events_json":"https://pith.science/api/pith-number/XCNYB6DAVFGVXGY43L35GZ55VJ/events.json","paper":"https://pith.science/paper/XCNYB6DA"},"agent_actions":{"view_html":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ","download_json":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ.json","view_paper":"https://pith.science/paper/XCNYB6DA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05927&json=true","fetch_graph":"https://pith.science/api/pith-number/XCNYB6DAVFGVXGY43L35GZ55VJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XCNYB6DAVFGVXGY43L35GZ55VJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/action/storage_attestation","attest_author":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/action/author_attestation","sign_citation":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/action/citation_signature","submit_replication":"https://pith.science/pith/XCNYB6DAVFGVXGY43L35GZ55VJ/action/replication_record"}},"created_at":"2026-05-18T02:28:47.193107+00:00","updated_at":"2026-05-18T02:28:47.193107+00:00"}