Guessing What, Noise or Codeword?
CoRR(2024)
摘要
In this paper, we distinguish two guessing algorithms for decoding binary
linear codes. One is the guessing noise decoding (GND) algorithm, and the other
is the guessing codeword decoding (GCD) algorithm. We prove that the GCD is a
maximum likelihood (ML) decoding algorithm and that the GCD is more efficient
than GND for most practical applications. We also introduce several variants of
ordered statistic decoding (OSD) to trade off the complexity of the Gaussian
elimination (GE) and that of the guessing, which may find applications in
decoding short block codes in the high signal-to-noise ratio (SNR) region.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要