{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SJXT5VXTAIPRUWSKACMS2RUSNS","short_pith_number":"pith:SJXT5VXT","schema_version":"1.0","canonical_sha256":"926f3ed6f3021f1a5a4a00992d46926c9e8873dc0cfc99960e7ade5dacb6ca69","source":{"kind":"arxiv","id":"2605.13201","version":1},"attestation_state":"computed","paper":{"title":"Decoding Product Codes and Staircase Codes with Iteration-Independent Weighting Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Improved decoder for product and staircase codes uses fixed weighting coefficients to gain 0.23 dB over Chase-Pyndiah","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Stra{\\ss}hofer","submitted_at":"2026-05-13T08:54:17Z","abstract_excerpt":"This paper presents an improved FEC decoder design outperforming Chase-Pyndiah decoding of product codes by $0.23$ dB. To achieve this, the decoder does not require iteration-dependent coefficients, making it implementation-friendly for sliding-window decoding of staircase codes."},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T08:54:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"65ac7664af379905726ceb3a84bc723e32408ee4ce217590ae3c73b6683df951","abstract_canon_sha256":"63d44383eab86df88d9a290465cc323c834fe724705343ebe633c569226ede18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:48.664735Z","signature_b64":"OFcfhVAzLkifeYkNWg07RaAp3kIQxYV0tX1/KTSicNUMYl9zMRDBNzN5u+otya+vxJvhJSk31TCyMci71HdzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926f3ed6f3021f1a5a4a00992d46926c9e8873dc0cfc99960e7ade5dacb6ca69","last_reissued_at":"2026-05-18T03:08:48.664157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:48.664157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Product Codes and Staircase Codes with Iteration-Independent Weighting Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Improved decoder for product and staircase codes uses fixed weighting coefficients to gain 0.23 dB over Chase-Pyndiah","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Stra{\\ss}hofer","submitted_at":"2026-05-13T08:54:17Z","abstract_excerpt":"This paper presents an improved FEC decoder design outperforming Chase-Pyndiah decoding of product codes by $0.23$ dB. To achieve this, the decoder does not require iteration-dependent coefficients, making it implementation-friendly for sliding-window decoding of staircase codes."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"presents an improved FEC decoder design outperforming Chase-Pyndiah decoding of product codes by 0.23 dB. To achieve this, the decoder does not require iteration-dependent coefficients, making it implementation-friendly for sliding-window decoding of staircase codes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That fixed weighting coefficients chosen once can maintain or exceed the performance of iteration-dependent coefficients across all decoding rounds and channel conditions without additional tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A product and staircase code decoder with iteration-independent weights outperforms Chase-Pyndiah by 0.23 dB and suits sliding-window hardware.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Improved decoder for product and staircase codes uses fixed weighting coefficients to gain 0.23 dB over Chase-Pyndiah","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a28e00025e0f98310430316f3f1a41928fe86131f511f4d73d63fc1f46de300b"},"source":{"id":"2605.13201","kind":"arxiv","version":1},"verdict":{"id":"d65e2a35-14e0-4d4c-be18-6f88c337e611","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:19:00.402867Z","strongest_claim":"presents an improved FEC decoder design outperforming Chase-Pyndiah decoding of product codes by 0.23 dB. To achieve this, the decoder does not require iteration-dependent coefficients, making it implementation-friendly for sliding-window decoding of staircase codes.","one_line_summary":"A product and staircase code decoder with iteration-independent weights outperforms Chase-Pyndiah by 0.23 dB and suits sliding-window hardware.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That fixed weighting coefficients chosen once can maintain or exceed the performance of iteration-dependent coefficients across all decoding rounds and channel conditions without additional tuning.","pith_extraction_headline":"Improved decoder for product and staircase codes uses fixed weighting coefficients to gain 0.23 dB over Chase-Pyndiah"},"references":{"count":6,"sample":[{"doi":"","year":1998,"title":"Near-optimum decoding of product codes: Block turbo codes","work_id":"bbc035b5-5b32-4b68-9a60-9057e55c79cf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tit.2024.3512412","year":2025,"title":"Soft-output suc- cessive cancellation list decoding","work_id":"67def54d-46fe-4989-b519-d22a8b80c856","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/twc","year":2025,"title":"Soft- output (so) grand and iterative decoding to outperform ldpcs","work_id":"6cf91f5b-1274-44a2-b880-fa1793f1dea3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Soft-output from covered space decoding of product codes","work_id":"1302faef-a95f-474f-9fdf-54efd3d60b73","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tit.2015.2410251","year":2015,"title":"List decoding of polar codes","work_id":"695278f6-13e3-4597-a47e-033cc008fd94","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"7570902dcc6b167568e01dafef8d8535a182b1adcaf7fe4d2331a4c1900a257b","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":"2605.13201","created_at":"2026-05-18T03:08:48.664253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13201v1","created_at":"2026-05-18T03:08:48.664253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13201","created_at":"2026-05-18T03:08:48.664253+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJXT5VXTAIPR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJXT5VXTAIPRUWSK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJXT5VXT","created_at":"2026-05-18T12:33:37.589309+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/SJXT5VXTAIPRUWSKACMS2RUSNS","json":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS.json","graph_json":"https://pith.science/api/pith-number/SJXT5VXTAIPRUWSKACMS2RUSNS/graph.json","events_json":"https://pith.science/api/pith-number/SJXT5VXTAIPRUWSKACMS2RUSNS/events.json","paper":"https://pith.science/paper/SJXT5VXT"},"agent_actions":{"view_html":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS","download_json":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS.json","view_paper":"https://pith.science/paper/SJXT5VXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13201&json=true","fetch_graph":"https://pith.science/api/pith-number/SJXT5VXTAIPRUWSKACMS2RUSNS/graph.json","fetch_events":"https://pith.science/api/pith-number/SJXT5VXTAIPRUWSKACMS2RUSNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS/action/storage_attestation","attest_author":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS/action/author_attestation","sign_citation":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS/action/citation_signature","submit_replication":"https://pith.science/pith/SJXT5VXTAIPRUWSKACMS2RUSNS/action/replication_record"}},"created_at":"2026-05-18T03:08:48.664253+00:00","updated_at":"2026-05-18T03:08:48.664253+00:00"}