Critical Point for Maximum Likelihood Decoding of Linear Block Codes
classification
💻 cs.IT
math.IT
keywords
codescodecriticaldecodingdistancelikelihoodmaximumpoint
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.