Abstract:Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. We evaluate different test-pattern sets for Chase-like decoding. Structured sets, such as Chase-II patterns or patterns chosen by logistic weight, are analyzed using order statistics, while arbitrary sets are evaluated by calculating covered-space probabilities and by performing Monte Carlo simulation. We further propose an algorithm that designs test-pattern sets to cover likely error patterns, achieving comparable performance with half the number of test patterns compared with conventional sets for high-rate BCH codes.
From: Tim Janz [view email]
[v1]
Fri, 8 May 2026 17:59:38 UTC (22 KB)
[v2]
Mon, 11 May 2026 07:31:56 UTC (23 KB)
[v3]
Wed, 2 Sep 2026 08:40:59 UTC (24 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。