Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 5 min ago
PreprintarXiv licencearXiv

Chase-like Decoding: Test-Pattern Design and Performance Analysis

  • Tim Janz
  • Simon Obermüller
  • Andreas Zunker
  • Stephan ten Brink
Open at sourcePDFDOICite

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.

Related

  1. Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes
    Xiaowei Wu, Min Qiu, Yueying Zhan +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. The Zero Pattern of a Design Matrix Drives Multiple Descent in Over-parameterized Regression
    Kevin Han Huang, Haoyu Ye, Somak Laha +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. NumericJev: Jev-like LLM Numerical Decoding with Multiway Decision Trees
    Weiwei Ye, Hangchen Liu, Renhe Jiang
    arXivPreprintCC BY-NC-SA 4.0Full textStatisticsarXiv
  4. QoS-Constrained Resource Pattern Design for V2X-ISAC Systems
    Hanyoung Park, Gangmin Kim, Yoo-Seung Song +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Hamming Ideals and Grobner Bases for ISD-like Syndrome Decoding
    Roberto La Scala, Marco Marchesin, Sharwan K. Tiwari
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{janz2026chaselike,
  title = {{Chase-like Decoding: Test-Pattern Design and Performance Analysis}},
  author = {Tim Janz and Simon Obermüller and Andreas Zunker and Stephan ten Brink},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.08081},
  eprint = {2605.08081},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.08081},
}
RIS
TY  - UNPB
TI  - Chase-like Decoding: Test-Pattern Design and Performance Analysis
AU  - Tim Janz
AU  - Simon Obermüller
AU  - Andreas Zunker
AU  - Stephan ten Brink
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2605.08081
UR  - https://arxiv.org/abs/2605.08081
AB  - 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.
ER  -