From the 1 of 6 linked papers with an AI index.
6 papers
Generalized Segmented GRAND for Guesswork Reduction in Turbo Product Decoding
Lukas Rapp, Jiewei Feng, Muriel Médard +1
The paper proposes GSegGRAND, a generalized version of Segmented GRAND decoding that works with a broader class of codes, incorporates more parity‑check constraints, and provides s…
SOGRAND decoding of LDPC codes
Ken R. Duffy, Jiewei Feng, Lukas Rapp +1
Long forward error correction codes are typically constructed by concatenating shorter component codes that are then decoded through iterative Soft-Input Soft-Output (SISO) of thei…
Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding
Lukas Rapp, Muriel Médard, Eugene Tang +1
We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-out…
Group Probability Decoding of Turbo Product Codes over Higher-Order Fields
Lukas Rapp, Muriel Médard, Ken R. Duffy
Binary turbo product codes (TPCs) are powerful error-correcting codes constructed from short component codes. Traditionally, turbo product decoding passes log likelihood ratios (LL…
SOGRAND Assisted Guesswork Reduction
Lukas Rapp, Muriel Médard, Ken R. Duffy
Proposals have been made to reduce the guesswork of Guessing Random Additive Noise Decoding (GRAND) for binary linear codes by leveraging codebook structure at the expense of degra…
A Balanced Tree Transformation to Reduce GRAND Queries
Lukas Rapp, Jiewei Feng, Muriel Médard +1
Guessing Random Additive Noise Decoding (GRAND) and its variants, known for their near-maximum likelihood performance, have been introduced in recent years. One such variant, Segme…