Soft-output Guessing Codeword Decoding
Ken R. Duffy, Peihong Yuan, Joseph Griffin, Muriel Medard
TL;DR
This paper demonstrates how to derive accurate soft outputs from Guessing Codeword Decoding with minimal extra complexity, enabling improved iterative decoding for long, high-redundancy codes.
Contribution
It introduces a method to extract soft outputs from Guessing Codeword Decoding, enhancing its utility for iterative decoding without significant additional computational cost.
Findings
Soft outputs can be accurately extracted from Guessing Codeword Decoding.
Blockwise soft output helps control decoding misdetection.
Bitwise soft output enables efficient iterative decoding.
Abstract
We establish that it is possible to extract accurate blockwise and bitwise soft output from Guessing Codeword Decoding with minimal additional computational complexity by considering it as a variant of Guessing Random Additive Noise Decoding. Blockwise soft output can be used to control decoding misdetection rate while bitwise soft output results in a soft-input soft-output decoder that can be used for efficient iterative decoding of long, high redundancy codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Coding theory and cryptography · graph theory and CDMA systems