English
Related papers

Related papers: Ordered Reliability Bits Guessing Random Additive …

200 papers

Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however,…

Information Theory · Computer Science 2022-10-12 Ken R. Duffy , Wei An , Muriel Medard

Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that can be used to perform maximum likelihood decoding. It attempts to find the errors introduced by the channel by generating a sequence of possible error…

Information Theory · Computer Science 2022-07-26 Carlo Condo

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed approximate Maximum Likelihood (ML) decoding technique that can decode any linear error-correcting block code. Ordered Reliability Bits GRAND (ORBGRAND) is a powerful…

Information Theory · Computer Science 2021-05-18 Syed Mohsin Abbas , Thibaud Tonnellier , Furkan Ercan , Marwan Jalaleddine , Warren J. Gross

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed decoding method searching for the error pattern applied to the transmitted codeword. Ordered reliability bit GRAND (ORBGRAND) uses soft channel information to reorder…

Information Theory · Computer Science 2021-10-01 Carlo Condo , Valerio Bioglio , Ingmar Land

Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that has been recently proposed as a practical way to perform maximum likelihood decoding. It generates a sequence of possible error patterns and applies them…

Information Theory · Computer Science 2022-02-09 Carlo Condo

Guessing random additive noise decoding (GRAND) is a recently proposed decoding paradigm particularly suitable for codes with short length and high rate. Among its variants, ordered reliability bits GRAND (ORBGRAND) exploits soft…

Information Theory · Computer Science 2024-04-30 Li Wan , Wenyi Zhang

Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through…

Information Theory · Computer Science 2023-08-11 Kevin Galligan , Peihong Yuan , Muriel Médard , Ken R. Duffy

In this work, we investigate guessing random additive noise decoding (GRAND) with quantized soft input. First, we analyze the achievable rate of ordered reliability bits GRAND (ORBGRAND), which uses the rank order of the reliability as…

Information Theory · Computer Science 2022-11-28 Peihong Yuan , Ken R. Duffy , Evan P. Gabhart , Muriel Médard

Guessing random additive noise decoding (GRAND) is a universal decoding paradigm that decodes by repeatedly testing error patterns until identifying a codeword, where the ordering of tests is generated by the received channel values. On one…

Information Theory · Computer Science 2025-07-14 Li Wan , Huarui Yin , Wenyi Zhang

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed universal Maximum Likelihood (ML) decoder for short-length and high-rate linear block-codes. Soft-GRAND (SGRAND) is a prominent soft-input GRAND variant, outperforming…

Information Theory · Computer Science 2022-12-05 Syed Mohsin Abbas , Marwan Jalaleddine , Warren J. Gross

Ultra-reliable low-latency communication (URLLC), a major 5G New-Radio use case, is the key enabler for applications with strict reliability and latency requirements. These applications necessitate the use of short-length and high-rate…

Information Theory · Computer Science 2022-03-14 Syed Mohsin Abbas , Thibaud Tonnellier , Furkan Ercan , Marwan Jalaleddine , Warren J. Gross

CRC codes have long since been adopted in a vast range of applications. The established notion that they are suitable primarily for error detection can be set aside through use of the recently proposed Guessing Random Additive Noise…

Information Theory · Computer Science 2024-10-28 Wei An , Muriel Médard , Ken R. Duffy

Guessing Random Additive Noise Decoding (GRAND) is a family of universal decoding algorithms suitable for decoding any moderate redundancy code of any length. We establish that, through the use of list decoding, soft-input variants of GRAND…

Information Theory · Computer Science 2022-08-10 Kevin Galligan , Muriel Médard , Ken R. Duffy

Guessing Random Additive Noise Decoding (GRAND) is a universal framework for decoding all block codes by testing candidate error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) facilitates parallel implementation of GRAND by…

Information Theory · Computer Science 2026-02-03 Li Wan , Wenyi Zhang

Guessing random additive noise decoding (GRAND) is a universal maximum-likelihood decoder that recovers code-words by guessing rank-ordered putative noise sequences and inverting their effect until one or more valid code-words are obtained.…

Information Theory · Computer Science 2023-04-18 Hadi Sarieddeen , Muriel Médard , Ken. R. Duffy

The ordered-reliability bits (ORB) variant of guessing random additive noise decoding (GRAND), known as ORBGRAND, achieves remarkably low time complexity at high code rates compared to other GRAND variants. However, its computational…

Information Theory · Computer Science 2025-02-05 Mohammad Rowshan , Jinhong Yuan

Within the Guessing Random Additive Noise Decoding (GRAND) family, ordered reliability bits GRAND (ORBGRAND) has received considerable attention for its hardware-friendly exploitation of soft information. Existing information-theoretic…

Information Theory · Computer Science 2026-03-12 Zhuang Li , Wenyi Zhang

Guessing random additive noise decoding (GRAND) is a maximum likelihood (ML) decoding method that identifies the noise effects corrupting code-words of arbitrary code-books. In a joint detection and decoding framework, this work…

Information Theory · Computer Science 2023-04-18 Hadi Sarieddeen , Muriel Médard , Ken. R. Duffy

Guessing random additive noise decoding (GRAND) has received widespread attention recently, and among its variants, ordered reliability bits GRAND (ORBGRAND) is particularly attractive due to its efficient utilization of soft information…

Information Theory · Computer Science 2024-04-30 Zhuang Li , Wenyi Zhang

We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that…

Information Theory · Computer Science 2023-10-19 Reza Hadavian , Xiaoting Huang , Dmitri Truhachev , Kamal El-Sankary , Hamid Ebrahimzad , Hossein Najafi
‹ Prev 1 2 3 10 Next ›