Critical Point for Maximum Likelihood Decoding of Linear Block Codes
Marc Fossorier

TL;DR
This paper identifies a critical SNR point where the error performance of soft decision maximum likelihood decoding aligns with the code's minimum distance slope, offering new insights into decoding of random-like codes.
Contribution
It introduces the concept of a critical SNR point for maximum likelihood decoding, enhancing understanding of decoding performance for random-like and Reed-Solomon codes.
Findings
Critical SNR point aligns with the slope of the error performance curve
Provides new insights into soft bounded distance decoding
Applicable to random-like and Reed-Solomon codes
Abstract
In this letter, the SNR value at which the error performance curve of a soft decision maximum likelihood decoder reaches the slope corresponding to the code minimum distance is determined for a random code. Based on this value, referred to as the critical point, new insight about soft bounded distance decoding of random-like codes (and particularly Reed-Solomon codes) is provided.
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.
