Work

Guessing what, Noise or Codeword?

Year: 2024

Type: conference-paper

Abstract: 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.

Source: IEEE Information Theory Workshop (ITW)

DOI: 10.1109/itw61385.2024.10806987

Author: Xiao Ma

Institutions: Sun Yat-sen University, Guangdong Province Key Laboratory of Information Security Technology

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Key Research and Development Program of China

Award: G2569668766