Critical Point for Maximum Likelihood Decoding of Linear Block Codes
Information Theory
2016-11-18 v1 math.IT
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.
Keywords
Cite
@article{arxiv.cs/0504032,
title = {Critical Point for Maximum Likelihood Decoding of Linear Block Codes},
author = {Marc Fossorier},
journal= {arXiv preprint arXiv:cs/0504032},
year = {2016}
}
Comments
to appear IEEE Communications Letters