Guessing What, Noise or Codeword?
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910311293911040 |
|---|---|
| author | Ma, Xiao |
| author_facet | Ma, Xiao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_16804 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Guessing What, Noise or Codeword? Ma, Xiao Information Theory 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. |
| title | Guessing What, Noise or Codeword? |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.16804 |